/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-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:12:56,691 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:12:56,744 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:56,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:12:56,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:12:56,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:12:56,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:12:56,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:12:56,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:12:56,773 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:12:56,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:12:56,773 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:12:56,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:12:56,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:12:56,774 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:12:56,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:12:56,774 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:12:56,774 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:12:56,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:12:56,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:12:56,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:12:56,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:12:56,775 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:56,775 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:56,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:12:56,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:12:56,776 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:12:56,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:12:56,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:12:56,776 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:12:56,776 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:12:56,776 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:56,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:12:56,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:12:56,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:12:56,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:12:56,986 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:12:56,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2025-04-13 22:12:58,283 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2c3666a/f5ad0abcdb4b4e2c94b65d4623cb0960/FLAG5e6cb519b [2025-04-13 22:12:58,512 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:12:58,516 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-symm.wvr.c [2025-04-13 22:12:58,523 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2c3666a/f5ad0abcdb4b4e2c94b65d4623cb0960/FLAG5e6cb519b [2025-04-13 22:12:59,284 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b2c3666a/f5ad0abcdb4b4e2c94b65d4623cb0960 [2025-04-13 22:12:59,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:12:59,287 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:12:59,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:12:59,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:12:59,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:12:59,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:12:59" (1/1) ... [2025-04-13 22:12:59,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@338d82db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:59, skipping insertion in model container [2025-04-13 22:12:59,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:12:59" (1/1) ... [2025-04-13 22:12:59,303 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:12:59,462 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-symm.wvr.c[2721,2734] [2025-04-13 22:12:59,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:12:59,488 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:12:59,522 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-symm.wvr.c[2721,2734] [2025-04-13 22:12:59,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:12:59,543 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:12:59,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:59 WrapperNode [2025-04-13 22:12:59,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:12:59,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:12:59,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:12:59,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:12:59,550 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:59" (1/1) ... [2025-04-13 22:12:59,557 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:59" (1/1) ... [2025-04-13 22:12:59,581 INFO L138 Inliner]: procedures = 24, calls = 27, calls flagged for inlining = 15, calls inlined = 19, statements flattened = 179 [2025-04-13 22:12:59,581 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:12:59,582 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:12:59,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:12:59,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:12:59,590 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:59" (1/1) ... [2025-04-13 22:12:59,590 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:59" (1/1) ... [2025-04-13 22:12:59,596 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:59" (1/1) ... [2025-04-13 22:12:59,610 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 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:59,610 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:59" (1/1) ... [2025-04-13 22:12:59,610 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:59" (1/1) ... [2025-04-13 22:12:59,616 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:59" (1/1) ... [2025-04-13 22:12:59,620 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:59" (1/1) ... [2025-04-13 22:12:59,620 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:59" (1/1) ... [2025-04-13 22:12:59,621 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:59" (1/1) ... [2025-04-13 22:12:59,625 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:12:59,626 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:12:59,626 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:12:59,626 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:12:59,626 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:59" (1/1) ... [2025-04-13 22:12:59,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:12:59,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:12:59,652 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:59,655 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:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:12:59,673 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:12:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:12:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:12:59,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:12:59,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:12:59,675 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:59,769 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:12:59,770 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:13:00,004 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:13:00,005 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:13:00,005 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:13:00,270 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:13:00,270 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:13:00 BoogieIcfgContainer [2025-04-13 22:13:00,271 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:13:00,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:13:00,272 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:13:00,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:13:00,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:12:59" (1/3) ... [2025-04-13 22:13:00,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3248de55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:13:00, skipping insertion in model container [2025-04-13 22:13:00,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:12:59" (2/3) ... [2025-04-13 22:13:00,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3248de55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:13:00, skipping insertion in model container [2025-04-13 22:13:00,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:13:00" (3/3) ... [2025-04-13 22:13:00,278 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-symm.wvr.c [2025-04-13 22:13:00,289 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:13:00,290 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-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:13:00,290 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:13:00,328 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 22:13:00,348 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 56 flow [2025-04-13 22:13:00,358 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:13:00,378 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:13:00,387 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;@1c3e9a2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:13:00,387 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 22:13:00,388 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:13:00,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 22:13:00,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:00,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:13:00,393 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:13:00,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash 224568057, now seen corresponding path program 1 times [2025-04-13 22:13:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:00,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270888200] [2025-04-13 22:13:00,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:13:00,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:00,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 22:13:00,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 22:13:00,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:00,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:00,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:13:00,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:00,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270888200] [2025-04-13 22:13:00,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270888200] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:13:00,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:13:00,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:13:00,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255529926] [2025-04-13 22:13:00,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:13:00,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:13:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:00,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:13:00,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:13:00,699 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:13:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:00,755 INFO L93 Difference]: Finished difference Result 66 states and 143 transitions. [2025-04-13 22:13:00,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:13:00,757 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:13:00,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:00,763 INFO L225 Difference]: With dead ends: 66 [2025-04-13 22:13:00,763 INFO L226 Difference]: Without dead ends: 35 [2025-04-13 22:13:00,765 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:13:00,766 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:13:00,767 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:13:00,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-13 22:13:00,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-13 22:13:00,787 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:13:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 73 transitions. [2025-04-13 22:13:00,792 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 73 transitions. Word has length 14 [2025-04-13 22:13:00,793 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:00,793 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 73 transitions. [2025-04-13 22:13:00,793 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:13:00,793 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 73 transitions. [2025-04-13 22:13:00,793 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 22:13:00,793 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:00,794 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:13:00,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:13:00,794 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:13:00,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:00,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1225043272, now seen corresponding path program 1 times [2025-04-13 22:13:00,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:00,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128623480] [2025-04-13 22:13:00,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:13:00,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:00,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:13:00,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:13:00,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:00,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:00,957 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:13:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:00,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128623480] [2025-04-13 22:13:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128623480] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:00,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131870202] [2025-04-13 22:13:00,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:13:00,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:00,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:00,960 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:13:00,963 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:13:01,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 22:13:01,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 22:13:01,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:01,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:01,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 22:13:01,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:01,088 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:13:01,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:01,105 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:13:01,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131870202] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:01,105 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:01,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-13 22:13:01,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675721545] [2025-04-13 22:13:01,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:01,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 22:13:01,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:01,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 22:13:01,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 22:13:01,106 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:13:01,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:01,170 INFO L93 Difference]: Finished difference Result 73 states and 154 transitions. [2025-04-13 22:13:01,170 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 22:13:01,170 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:13:01,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:01,171 INFO L225 Difference]: With dead ends: 73 [2025-04-13 22:13:01,171 INFO L226 Difference]: Without dead ends: 41 [2025-04-13 22:13:01,171 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:13:01,171 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:13:01,172 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:13:01,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-13 22:13:01,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-04-13 22:13:01,175 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:13:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 79 transitions. [2025-04-13 22:13:01,176 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 79 transitions. Word has length 16 [2025-04-13 22:13:01,176 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:01,176 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 79 transitions. [2025-04-13 22:13:01,176 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:13:01,176 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 79 transitions. [2025-04-13 22:13:01,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:13:01,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:01,176 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:13:01,184 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:13:01,377 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:13:01,377 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:13:01,377 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:01,378 INFO L85 PathProgramCache]: Analyzing trace with hash 95105849, now seen corresponding path program 2 times [2025-04-13 22:13:01,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:01,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292624998] [2025-04-13 22:13:01,378 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:01,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:01,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:13:01,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 22 statements. [2025-04-13 22:13:01,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:13:01,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:01,564 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:13:01,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:01,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292624998] [2025-04-13 22:13:01,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292624998] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:13:01,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:13:01,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:13:01,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012722338] [2025-04-13 22:13:01,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:13:01,565 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:13:01,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:01,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:13:01,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:13:01,566 INFO L87 Difference]: Start difference. First operand 41 states and 79 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:01,626 INFO L93 Difference]: Finished difference Result 53 states and 105 transitions. [2025-04-13 22:13:01,626 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:13:01,626 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:01,626 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:01,627 INFO L225 Difference]: With dead ends: 53 [2025-04-13 22:13:01,627 INFO L226 Difference]: Without dead ends: 46 [2025-04-13 22:13:01,627 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:13:01,627 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:01,628 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 0 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:13:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-04-13 22:13:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2025-04-13 22:13:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 2.022222222222222) internal successors, (91), 45 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call 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:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 91 transitions. [2025-04-13 22:13:01,636 INFO L79 Accepts]: Start accepts. Automaton has 46 states and 91 transitions. Word has length 22 [2025-04-13 22:13:01,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:01,636 INFO L485 AbstractCegarLoop]: Abstraction has 46 states and 91 transitions. [2025-04-13 22:13:01,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:01,636 INFO L278 IsEmpty]: Start isEmpty. Operand 46 states and 91 transitions. [2025-04-13 22:13:01,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:13:01,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:01,638 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:13:01,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:13:01,638 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:13:01,638 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:01,638 INFO L85 PathProgramCache]: Analyzing trace with hash -368363327, now seen corresponding path program 3 times [2025-04-13 22:13:01,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:01,638 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483292280] [2025-04-13 22:13:01,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:01,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:01,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 22:13:01,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 22 statements. [2025-04-13 22:13:01,666 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:13:01,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:01,787 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:13:01,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:01,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483292280] [2025-04-13 22:13:01,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483292280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:13:01,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:13:01,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:13:01,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714302327] [2025-04-13 22:13:01,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:13:01,788 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:13:01,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:01,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:13:01,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:13:01,788 INFO L87 Difference]: Start difference. First operand 46 states and 91 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:01,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:01,837 INFO L93 Difference]: Finished difference Result 69 states and 136 transitions. [2025-04-13 22:13:01,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:13:01,838 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:01,838 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:01,838 INFO L225 Difference]: With dead ends: 69 [2025-04-13 22:13:01,838 INFO L226 Difference]: Without dead ends: 60 [2025-04-13 22:13:01,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:13:01,839 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:01,839 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 0 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:13:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-13 22:13:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2025-04-13 22:13:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 2.0425531914893615) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call 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:01,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 96 transitions. [2025-04-13 22:13:01,844 INFO L79 Accepts]: Start accepts. Automaton has 48 states and 96 transitions. Word has length 22 [2025-04-13 22:13:01,844 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:01,844 INFO L485 AbstractCegarLoop]: Abstraction has 48 states and 96 transitions. [2025-04-13 22:13:01,844 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:01,844 INFO L278 IsEmpty]: Start isEmpty. Operand 48 states and 96 transitions. [2025-04-13 22:13:01,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 22:13:01,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:01,844 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:13:01,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 22:13:01,844 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:13:01,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:01,845 INFO L85 PathProgramCache]: Analyzing trace with hash 381472621, now seen corresponding path program 4 times [2025-04-13 22:13:01,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:01,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874555182] [2025-04-13 22:13:01,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:01,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:01,853 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:13:01,865 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:13:01,865 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:01,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:01,964 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:13:01,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:01,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874555182] [2025-04-13 22:13:01,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874555182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:01,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265047354] [2025-04-13 22:13:01,965 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:01,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:01,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:01,967 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:13:01,968 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:13:02,021 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 22:13:02,051 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 22:13:02,051 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:02,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 22:13:02,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:02,101 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:13:02,101 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:02,132 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:13:02,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265047354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:02,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:02,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 22:13:02,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439045337] [2025-04-13 22:13:02,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:02,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 22:13:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:02,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 22:13:02,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:13:02,133 INFO L87 Difference]: Start difference. First operand 48 states and 96 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 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:13:02,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:02,176 INFO L93 Difference]: Finished difference Result 92 states and 189 transitions. [2025-04-13 22:13:02,177 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 22:13:02,177 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 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 22 [2025-04-13 22:13:02,177 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:02,177 INFO L225 Difference]: With dead ends: 92 [2025-04-13 22:13:02,177 INFO L226 Difference]: Without dead ends: 50 [2025-04-13 22:13:02,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:13:02,178 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:02,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:13:02,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-04-13 22:13:02,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-04-13 22:13:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.0) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 98 transitions. [2025-04-13 22:13:02,189 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 98 transitions. Word has length 22 [2025-04-13 22:13:02,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:02,189 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 98 transitions. [2025-04-13 22:13:02,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 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:13:02,189 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 98 transitions. [2025-04-13 22:13:02,190 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 22:13:02,190 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:02,190 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:13:02,196 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:13:02,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:02,390 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:13:02,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:02,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1914423772, now seen corresponding path program 5 times [2025-04-13 22:13:02,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:02,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219412493] [2025-04-13 22:13:02,391 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:02,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:02,407 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 4 equivalence classes. [2025-04-13 22:13:02,434 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 22:13:02,434 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:02,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:02,582 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:13:02,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:02,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219412493] [2025-04-13 22:13:02,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219412493] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:13:02,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:13:02,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:13:02,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538899348] [2025-04-13 22:13:02,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:13:02,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:13:02,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:02,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:13:02,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:13:02,583 INFO L87 Difference]: Start difference. First operand 50 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:02,678 INFO L93 Difference]: Finished difference Result 62 states and 124 transitions. [2025-04-13 22:13:02,679 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:13:02,679 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:02,679 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:02,679 INFO L225 Difference]: With dead ends: 62 [2025-04-13 22:13:02,679 INFO L226 Difference]: Without dead ends: 55 [2025-04-13 22:13:02,680 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:13:02,680 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:02,680 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 0 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:02,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-04-13 22:13:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2025-04-13 22:13:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 2.0) internal successors, (98), 49 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call 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,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 98 transitions. [2025-04-13 22:13:02,688 INFO L79 Accepts]: Start accepts. Automaton has 50 states and 98 transitions. Word has length 24 [2025-04-13 22:13:02,689 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:02,689 INFO L485 AbstractCegarLoop]: Abstraction has 50 states and 98 transitions. [2025-04-13 22:13:02,689 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 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:13:02,689 INFO L278 IsEmpty]: Start isEmpty. Operand 50 states and 98 transitions. [2025-04-13 22:13:02,689 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:13:02,689 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:02,689 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:13:02,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:13:02,689 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:13:02,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:02,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1772826896, now seen corresponding path program 1 times [2025-04-13 22:13:02,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:02,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169368520] [2025-04-13 22:13:02,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:13:02,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:02,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 22:13:02,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 22:13:02,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:02,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:13:02,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:02,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169368520] [2025-04-13 22:13:02,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169368520] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:13:02,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:13:02,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:13:02,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208632164] [2025-04-13 22:13:02,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:13:02,867 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:13:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:02,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:13:02,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:13:02,867 INFO L87 Difference]: Start difference. First operand 50 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:02,935 INFO L93 Difference]: Finished difference Result 104 states and 211 transitions. [2025-04-13 22:13:02,935 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:13:02,935 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:02,935 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:02,936 INFO L225 Difference]: With dead ends: 104 [2025-04-13 22:13:02,936 INFO L226 Difference]: Without dead ends: 93 [2025-04-13 22:13:02,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:13:02,937 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 15 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:02,937 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:13:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-13 22:13:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 60. [2025-04-13 22:13:02,959 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:13:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 126 transitions. [2025-04-13 22:13:02,960 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 126 transitions. Word has length 25 [2025-04-13 22:13:02,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:02,960 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 126 transitions. [2025-04-13 22:13:02,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:02,960 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 126 transitions. [2025-04-13 22:13:02,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:13:02,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:02,961 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:13:02,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:13:02,961 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:13:02,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash 7776214, now seen corresponding path program 2 times [2025-04-13 22:13:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:02,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95851895] [2025-04-13 22:13:02,961 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:02,969 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 22:13:02,979 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 25 statements. [2025-04-13 22:13:02,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:13:02,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:13:03,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:03,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95851895] [2025-04-13 22:13:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95851895] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:13:03,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:13:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:13:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944436368] [2025-04-13 22:13:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:13:03,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:13:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:03,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:13:03,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:13:03,058 INFO L87 Difference]: Start difference. First operand 60 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:03,112 INFO L93 Difference]: Finished difference Result 77 states and 164 transitions. [2025-04-13 22:13:03,112 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:13:03,113 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:03,113 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:03,113 INFO L225 Difference]: With dead ends: 77 [2025-04-13 22:13:03,113 INFO L226 Difference]: Without dead ends: 66 [2025-04-13 22:13:03,113 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 22:13:03,114 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 13 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:03,114 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 0 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:13:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-04-13 22:13:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2025-04-13 22:13:03,124 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:13:03,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 126 transitions. [2025-04-13 22:13:03,124 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 126 transitions. Word has length 25 [2025-04-13 22:13:03,126 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:03,126 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 126 transitions. [2025-04-13 22:13:03,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:03,126 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 126 transitions. [2025-04-13 22:13:03,127 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 22:13:03,127 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:03,127 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:13:03,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 22:13:03,127 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:13:03,127 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:03,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1321394630, now seen corresponding path program 3 times [2025-04-13 22:13:03,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:03,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305462456] [2025-04-13 22:13:03,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:03,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:03,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 22:13:03,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 25 statements. [2025-04-13 22:13:03,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:13:03,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:13:03,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:03,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305462456] [2025-04-13 22:13:03,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305462456] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:13:03,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:13:03,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 22:13:03,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365248054] [2025-04-13 22:13:03,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:13:03,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 22:13:03,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:03,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 22:13:03,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:13:03,229 INFO L87 Difference]: Start difference. First operand 60 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:03,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:03,276 INFO L93 Difference]: Finished difference Result 76 states and 150 transitions. [2025-04-13 22:13:03,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 22:13:03,277 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:03,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:03,278 INFO L225 Difference]: With dead ends: 76 [2025-04-13 22:13:03,278 INFO L226 Difference]: Without dead ends: 60 [2025-04-13 22:13:03,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 22:13:03,278 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 8 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:03,279 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:13:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-13 22:13:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-13 22:13:03,288 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:13:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2025-04-13 22:13:03,289 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2025-04-13 22:13:03,290 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:03,290 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2025-04-13 22:13:03,290 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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:13:03,290 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2025-04-13 22:13:03,290 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:03,290 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:03,290 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:03,291 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:13:03,291 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:13:03,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash 241690115, now seen corresponding path program 1 times [2025-04-13 22:13:03,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:03,291 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85150293] [2025-04-13 22:13:03,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:13:03,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:03,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:13:03,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:03,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:03,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:04,028 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,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:04,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85150293] [2025-04-13 22:13:04,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85150293] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:04,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636880550] [2025-04-13 22:13:04,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:13:04,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:04,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:04,030 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:13:04,031 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:13:04,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:13:04,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:04,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:04,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:04,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:13:04,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:04,210 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:04,211 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 27 treesize of output 23 [2025-04-13 22:13:04,241 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,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:04,667 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:13:04,667 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 126 treesize of output 79 [2025-04-13 22:13:04,712 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,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636880550] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:04,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:04,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-04-13 22:13:04,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825966810] [2025-04-13 22:13:04,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:04,713 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:13:04,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:04,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:13:04,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:04,714 INFO L87 Difference]: Start difference. First operand 60 states and 122 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:13:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:05,118 INFO L93 Difference]: Finished difference Result 96 states and 204 transitions. [2025-04-13 22:13:05,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:13:05,118 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:13:05,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:05,119 INFO L225 Difference]: With dead ends: 96 [2025-04-13 22:13:05,119 INFO L226 Difference]: Without dead ends: 91 [2025-04-13 22:13:05,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:13:05,120 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:05,120 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-13 22:13:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2025-04-13 22:13:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.1884057971014492) internal successors, (151), 69 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call 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:05,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 151 transitions. [2025-04-13 22:13:05,129 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 151 transitions. Word has length 26 [2025-04-13 22:13:05,129 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:05,129 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 151 transitions. [2025-04-13 22:13:05,129 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:13:05,130 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 151 transitions. [2025-04-13 22:13:05,130 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:05,130 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:05,130 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:05,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:05,330 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:13:05,331 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:13:05,331 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:05,331 INFO L85 PathProgramCache]: Analyzing trace with hash -876313591, now seen corresponding path program 2 times [2025-04-13 22:13:05,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:05,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129998648] [2025-04-13 22:13:05,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:05,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:05,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:05,378 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:05,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:05,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:05,922 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,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:05,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129998648] [2025-04-13 22:13:05,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129998648] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:05,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014360472] [2025-04-13 22:13:05,922 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:05,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:05,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:05,924 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:13:05,925 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:13:05,981 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:06,010 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:06,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:06,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:06,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:06,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:06,123 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:06,123 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 27 treesize of output 19 [2025-04-13 22:13:06,150 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:06,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:06,496 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:13:06,497 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 173 treesize of output 107 [2025-04-13 22:13:06,584 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:06,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014360472] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:06,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:06,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:06,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37402934] [2025-04-13 22:13:06,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:06,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:13:06,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:06,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:13:06,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:13:06,585 INFO L87 Difference]: Start difference. First operand 70 states and 151 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:13:06,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:06,963 INFO L93 Difference]: Finished difference Result 90 states and 195 transitions. [2025-04-13 22:13:06,963 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:06,963 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:13:06,963 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:06,964 INFO L225 Difference]: With dead ends: 90 [2025-04-13 22:13:06,964 INFO L226 Difference]: Without dead ends: 85 [2025-04-13 22:13:06,964 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:13:06,964 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:06,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-13 22:13:06,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 74. [2025-04-13 22:13:06,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.232876712328767) internal successors, (163), 73 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call 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,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 163 transitions. [2025-04-13 22:13:06,973 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 163 transitions. Word has length 26 [2025-04-13 22:13:06,973 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:06,973 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 163 transitions. [2025-04-13 22:13:06,973 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:13:06,974 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 163 transitions. [2025-04-13 22:13:06,974 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:06,974 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:06,974 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,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 22:13:07,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:07,175 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:13:07,175 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash -550400829, now seen corresponding path program 3 times [2025-04-13 22:13:07,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:07,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538156444] [2025-04-13 22:13:07,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:07,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:07,184 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:07,227 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:07,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:07,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:07,590 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:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:07,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538156444] [2025-04-13 22:13:07,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538156444] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:07,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450105370] [2025-04-13 22:13:07,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:07,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:07,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:07,592 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:13:07,594 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:13:07,653 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:07,676 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:07,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:07,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:07,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:07,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:07,766 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:07,766 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 27 treesize of output 19 [2025-04-13 22:13:07,789 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:07,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:08,074 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:13:08,075 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 173 treesize of output 107 [2025-04-13 22:13:08,159 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:08,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450105370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:08,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:08,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:08,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466310707] [2025-04-13 22:13:08,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:08,159 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:13:08,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:08,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:13:08,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:13:08,161 INFO L87 Difference]: Start difference. First operand 74 states and 163 transitions. Second operand has 21 states, 20 states have (on average 2.15) 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:13:08,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:08,511 INFO L93 Difference]: Finished difference Result 93 states and 204 transitions. [2025-04-13 22:13:08,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:08,511 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) 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 26 [2025-04-13 22:13:08,511 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:08,512 INFO L225 Difference]: With dead ends: 93 [2025-04-13 22:13:08,512 INFO L226 Difference]: Without dead ends: 88 [2025-04-13 22:13:08,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=618, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:13:08,513 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:08,513 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:08,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-13 22:13:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2025-04-13 22:13:08,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 2.2253521126760565) internal successors, (158), 71 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call 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:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 158 transitions. [2025-04-13 22:13:08,520 INFO L79 Accepts]: Start accepts. Automaton has 72 states and 158 transitions. Word has length 26 [2025-04-13 22:13:08,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:08,520 INFO L485 AbstractCegarLoop]: Abstraction has 72 states and 158 transitions. [2025-04-13 22:13:08,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) 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:13:08,520 INFO L278 IsEmpty]: Start isEmpty. Operand 72 states and 158 transitions. [2025-04-13 22:13:08,521 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:08,521 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:08,521 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:08,527 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:13:08,725 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,SelfDestructingSolverStorable11 [2025-04-13 22:13:08,725 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:13:08,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:08,725 INFO L85 PathProgramCache]: Analyzing trace with hash -71066383, now seen corresponding path program 4 times [2025-04-13 22:13:08,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:08,725 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475929595] [2025-04-13 22:13:08,725 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:08,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:08,732 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:08,745 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:08,745 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:08,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:09,247 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:09,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:09,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475929595] [2025-04-13 22:13:09,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475929595] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:09,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79292268] [2025-04-13 22:13:09,247 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:09,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:09,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:09,249 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:13:09,250 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:13:09,307 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:09,331 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:09,331 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:09,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:09,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:13:09,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:09,386 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:09,386 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 27 treesize of output 23 [2025-04-13 22:13:09,426 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:09,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:09,694 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:13:09,694 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 173 treesize of output 107 [2025-04-13 22:13:09,771 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:09,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79292268] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:09,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:09,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-04-13 22:13:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750604553] [2025-04-13 22:13:09,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:09,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:13:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:09,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:13:09,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:09,772 INFO L87 Difference]: Start difference. First operand 72 states and 158 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:13:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:10,169 INFO L93 Difference]: Finished difference Result 94 states and 205 transitions. [2025-04-13 22:13:10,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:10,170 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:13:10,170 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:10,170 INFO L225 Difference]: With dead ends: 94 [2025-04-13 22:13:10,170 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 22:13:10,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:13:10,171 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:10,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 22:13:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 74. [2025-04-13 22:13:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.232876712328767) internal successors, (163), 73 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call 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:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 163 transitions. [2025-04-13 22:13:10,182 INFO L79 Accepts]: Start accepts. Automaton has 74 states and 163 transitions. Word has length 26 [2025-04-13 22:13:10,182 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:10,182 INFO L485 AbstractCegarLoop]: Abstraction has 74 states and 163 transitions. [2025-04-13 22:13:10,183 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:13:10,183 INFO L278 IsEmpty]: Start isEmpty. Operand 74 states and 163 transitions. [2025-04-13 22:13:10,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:10,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:10,183 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:10,190 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:13:10,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:10,387 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:13:10,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:10,387 INFO L85 PathProgramCache]: Analyzing trace with hash -605812089, now seen corresponding path program 5 times [2025-04-13 22:13:10,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:10,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724001174] [2025-04-13 22:13:10,387 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:10,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:10,394 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:10,420 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:10,420 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:10,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:10,860 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:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:10,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724001174] [2025-04-13 22:13:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724001174] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:10,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622874039] [2025-04-13 22:13:10,860 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:10,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:10,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:10,862 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:13:10,864 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:13:10,923 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:10,990 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:10,991 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:10,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:10,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:13:10,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:11,064 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:11,064 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 27 treesize of output 23 [2025-04-13 22:13:11,107 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:11,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:11,364 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:13:11,364 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 173 treesize of output 107 [2025-04-13 22:13:11,439 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:11,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622874039] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:11,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:11,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2025-04-13 22:13:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304638427] [2025-04-13 22:13:11,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:11,440 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:13:11,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:11,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:13:11,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:11,440 INFO L87 Difference]: Start difference. First operand 74 states and 163 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:13:11,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:11,761 INFO L93 Difference]: Finished difference Result 93 states and 200 transitions. [2025-04-13 22:13:11,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:11,761 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:13:11,761 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:11,762 INFO L225 Difference]: With dead ends: 93 [2025-04-13 22:13:11,762 INFO L226 Difference]: Without dead ends: 88 [2025-04-13 22:13:11,763 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:13:11,763 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:11,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:11,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-13 22:13:11,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2025-04-13 22:13:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 2.1884057971014492) internal successors, (151), 69 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call 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:11,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 151 transitions. [2025-04-13 22:13:11,770 INFO L79 Accepts]: Start accepts. Automaton has 70 states and 151 transitions. Word has length 26 [2025-04-13 22:13:11,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:11,770 INFO L485 AbstractCegarLoop]: Abstraction has 70 states and 151 transitions. [2025-04-13 22:13:11,770 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:13:11,770 INFO L278 IsEmpty]: Start isEmpty. Operand 70 states and 151 transitions. [2025-04-13 22:13:11,770 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:11,770 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:11,770 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:11,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 22:13:11,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:11,971 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:13:11,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:11,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1702579401, now seen corresponding path program 6 times [2025-04-13 22:13:11,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:11,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502210788] [2025-04-13 22:13:11,971 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:11,979 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:12,004 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:12,007 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:12,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:12,387 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,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:12,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502210788] [2025-04-13 22:13:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502210788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:12,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430964709] [2025-04-13 22:13:12,387 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:12,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:12,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:12,389 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:13:12,390 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:13:12,455 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 22:13:12,481 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:12,481 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:12,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:12,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:12,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:12,551 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:12,552 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 27 treesize of output 19 [2025-04-13 22:13:12,593 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,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:12,847 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:13:12,848 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 173 treesize of output 107 [2025-04-13 22:13:12,927 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,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430964709] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:12,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:12,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:12,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319515438] [2025-04-13 22:13:12,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:12,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:13:12,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:12,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:13:12,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:13:12,929 INFO L87 Difference]: Start difference. First operand 70 states and 151 transitions. Second operand has 21 states, 20 states have (on average 2.15) 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:13:13,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:13,244 INFO L93 Difference]: Finished difference Result 98 states and 209 transitions. [2025-04-13 22:13:13,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:13,245 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.15) 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 26 [2025-04-13 22:13:13,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:13,245 INFO L225 Difference]: With dead ends: 98 [2025-04-13 22:13:13,245 INFO L226 Difference]: Without dead ends: 89 [2025-04-13 22:13:13,246 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:13:13,246 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:13,246 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-04-13 22:13:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2025-04-13 22:13:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 2.210526315789474) internal successors, (168), 76 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call 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:13,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 168 transitions. [2025-04-13 22:13:13,257 INFO L79 Accepts]: Start accepts. Automaton has 77 states and 168 transitions. Word has length 26 [2025-04-13 22:13:13,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:13,257 INFO L485 AbstractCegarLoop]: Abstraction has 77 states and 168 transitions. [2025-04-13 22:13:13,257 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.15) 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:13:13,257 INFO L278 IsEmpty]: Start isEmpty. Operand 77 states and 168 transitions. [2025-04-13 22:13:13,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:13,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:13,257 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:13,263 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 22:13:13,460 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,SelfDestructingSolverStorable14 [2025-04-13 22:13:13,460 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:13:13,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:13,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1112531617, now seen corresponding path program 7 times [2025-04-13 22:13:13,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:13,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870153891] [2025-04-13 22:13:13,461 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:13,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:13,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:13:13,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:13,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:13,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:13,841 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:13,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:13,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870153891] [2025-04-13 22:13:13,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870153891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:13,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31011981] [2025-04-13 22:13:13,841 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:13,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:13,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:13,844 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:13:13,845 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:13:13,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 22:13:13,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 22:13:13,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:13,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:13,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:13:13,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:13,983 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:13,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 27 treesize of output 23 [2025-04-13 22:13:14,020 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:14,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:14,265 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:13:14,265 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 173 treesize of output 107 [2025-04-13 22:13:14,333 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:14,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31011981] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:14,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:14,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2025-04-13 22:13:14,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157727792] [2025-04-13 22:13:14,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:14,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:13:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:14,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:13:14,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:14,335 INFO L87 Difference]: Start difference. First operand 77 states and 168 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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:13:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:14,613 INFO L93 Difference]: Finished difference Result 104 states and 223 transitions. [2025-04-13 22:13:14,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:14,613 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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:13:14,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:14,614 INFO L225 Difference]: With dead ends: 104 [2025-04-13 22:13:14,614 INFO L226 Difference]: Without dead ends: 95 [2025-04-13 22:13:14,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=608, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:13:14,614 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 78 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:14,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 0 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-13 22:13:14,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2025-04-13 22:13:14,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.2027027027027026) internal successors, (163), 74 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call 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,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 163 transitions. [2025-04-13 22:13:14,625 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 163 transitions. Word has length 26 [2025-04-13 22:13:14,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:14,625 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 163 transitions. [2025-04-13 22:13:14,626 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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:13:14,626 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 163 transitions. [2025-04-13 22:13:14,626 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 22:13:14,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:14,626 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,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 22:13:14,830 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,SelfDestructingSolverStorable15 [2025-04-13 22:13:14,830 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:13:14,830 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:14,830 INFO L85 PathProgramCache]: Analyzing trace with hash -243925135, now seen corresponding path program 8 times [2025-04-13 22:13:14,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:14,830 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416013617] [2025-04-13 22:13:14,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:14,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:14,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:14,852 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:14,852 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:14,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:15,277 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:15,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:15,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416013617] [2025-04-13 22:13:15,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416013617] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:15,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124925321] [2025-04-13 22:13:15,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:15,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:15,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:15,280 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:13:15,281 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:13:15,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 22:13:15,371 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:15,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:15,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:15,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:15,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:15,450 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:15,450 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 27 treesize of output 19 [2025-04-13 22:13:15,482 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:15,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:15,717 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:13:15,717 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 118 treesize of output 79 [2025-04-13 22:13:15,751 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:15,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124925321] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:15,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:15,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2025-04-13 22:13:15,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476159771] [2025-04-13 22:13:15,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:15,752 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:13:15,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:15,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:13:15,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:15,752 INFO L87 Difference]: Start difference. First operand 75 states and 163 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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:13:16,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:16,242 INFO L93 Difference]: Finished difference Result 125 states and 267 transitions. [2025-04-13 22:13:16,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:16,242 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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:13:16,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:16,243 INFO L225 Difference]: With dead ends: 125 [2025-04-13 22:13:16,243 INFO L226 Difference]: Without dead ends: 116 [2025-04-13 22:13:16,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:13:16,244 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:16,244 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:13:16,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-13 22:13:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 84. [2025-04-13 22:13:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 2.2048192771084336) internal successors, (183), 83 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call 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:16,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 183 transitions. [2025-04-13 22:13:16,258 INFO L79 Accepts]: Start accepts. Automaton has 84 states and 183 transitions. Word has length 26 [2025-04-13 22:13:16,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:16,258 INFO L485 AbstractCegarLoop]: Abstraction has 84 states and 183 transitions. [2025-04-13 22:13:16,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 22 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:13:16,258 INFO L278 IsEmpty]: Start isEmpty. Operand 84 states and 183 transitions. [2025-04-13 22:13:16,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:16,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:16,258 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:16,264 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:13:16,463 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 22:13:16,463 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:13:16,463 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:16,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1096913546, now seen corresponding path program 9 times [2025-04-13 22:13:16,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:16,463 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249102159] [2025-04-13 22:13:16,463 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:16,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:16,470 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:16,486 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:16,486 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:16,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:16,780 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:16,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:16,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249102159] [2025-04-13 22:13:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249102159] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:16,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074713877] [2025-04-13 22:13:16,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:16,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:16,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:16,782 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:13:16,783 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:13:16,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:16,870 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:16,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:16,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:16,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:13:16,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:17,000 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:17,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:17,105 INFO L325 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2025-04-13 22:13:17,106 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 63 treesize of output 67 [2025-04-13 22:13:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:17,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074713877] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:17,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:17,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:17,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269947779] [2025-04-13 22:13:17,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:17,142 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:17,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:17,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:17,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:17,143 INFO L87 Difference]: Start difference. First operand 84 states and 183 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:13:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:17,428 INFO L93 Difference]: Finished difference Result 112 states and 232 transitions. [2025-04-13 22:13:17,428 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:13:17,428 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 27 [2025-04-13 22:13:17,428 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:17,429 INFO L225 Difference]: With dead ends: 112 [2025-04-13 22:13:17,429 INFO L226 Difference]: Without dead ends: 99 [2025-04-13 22:13:17,429 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:13:17,430 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:17,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-13 22:13:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 82. [2025-04-13 22:13:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 2.197530864197531) internal successors, (178), 81 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call 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:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 178 transitions. [2025-04-13 22:13:17,446 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 178 transitions. Word has length 27 [2025-04-13 22:13:17,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:17,446 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 178 transitions. [2025-04-13 22:13:17,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:13:17,446 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 178 transitions. [2025-04-13 22:13:17,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:17,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:17,447 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:17,455 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:13:17,649 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,SelfDestructingSolverStorable17 [2025-04-13 22:13:17,649 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:13:17,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:17,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1395290064, now seen corresponding path program 10 times [2025-04-13 22:13:17,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:17,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809522801] [2025-04-13 22:13:17,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:17,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:17,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:17,680 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:17,680 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:17,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:17,997 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:17,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:17,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809522801] [2025-04-13 22:13:17,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809522801] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:17,998 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970552370] [2025-04-13 22:13:17,998 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:17,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:17,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:18,000 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:13:18,000 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:13:18,068 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:18,095 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:18,096 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:18,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:18,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:18,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:18,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:18,268 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:18,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 71 treesize of output 88 [2025-04-13 22:13:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:18,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [970552370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:18,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:18,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-04-13 22:13:18,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53876057] [2025-04-13 22:13:18,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:18,311 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:18,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:18,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:18,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:18,311 INFO L87 Difference]: Start difference. First operand 82 states and 178 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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:13:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:18,470 INFO L93 Difference]: Finished difference Result 99 states and 208 transitions. [2025-04-13 22:13:18,471 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:13:18,471 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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 27 [2025-04-13 22:13:18,471 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:18,471 INFO L225 Difference]: With dead ends: 99 [2025-04-13 22:13:18,471 INFO L226 Difference]: Without dead ends: 88 [2025-04-13 22:13:18,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:13:18,472 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:18,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:18,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-13 22:13:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2025-04-13 22:13:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 2.211764705882353) internal successors, (188), 85 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call 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,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 188 transitions. [2025-04-13 22:13:18,484 INFO L79 Accepts]: Start accepts. Automaton has 86 states and 188 transitions. Word has length 27 [2025-04-13 22:13:18,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:18,484 INFO L485 AbstractCegarLoop]: Abstraction has 86 states and 188 transitions. [2025-04-13 22:13:18,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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:13:18,484 INFO L278 IsEmpty]: Start isEmpty. Operand 86 states and 188 transitions. [2025-04-13 22:13:18,484 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:18,484 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:18,485 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:18,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:18,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:18,685 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:13:18,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:18,685 INFO L85 PathProgramCache]: Analyzing trace with hash -322220319, now seen corresponding path program 11 times [2025-04-13 22:13:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:18,685 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851010677] [2025-04-13 22:13:18,685 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:18,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:18,692 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:18,710 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:18,710 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:18,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:19,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851010677] [2025-04-13 22:13:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851010677] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:19,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224857111] [2025-04-13 22:13:19,024 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:19,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:19,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:19,027 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:13:19,028 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:13:19,094 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:19,193 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:19,193 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:19,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:19,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:13:19,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:19,296 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:13:19,296 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 25 treesize of output 9 [2025-04-13 22:13:19,298 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:19,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:19,380 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:13:19,380 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 32 treesize of output 48 [2025-04-13 22:13:19,393 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:19,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224857111] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:19,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:19,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-04-13 22:13:19,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201405389] [2025-04-13 22:13:19,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:19,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:13:19,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:19,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:13:19,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:13:19,394 INFO L87 Difference]: Start difference. First operand 86 states and 188 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:19,559 INFO L93 Difference]: Finished difference Result 119 states and 258 transitions. [2025-04-13 22:13:19,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:13:19,560 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 27 [2025-04-13 22:13:19,560 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:19,560 INFO L225 Difference]: With dead ends: 119 [2025-04-13 22:13:19,560 INFO L226 Difference]: Without dead ends: 111 [2025-04-13 22:13:19,561 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:19,561 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:19,561 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:19,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-13 22:13:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2025-04-13 22:13:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.2413793103448274) internal successors, (195), 87 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call 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:19,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 195 transitions. [2025-04-13 22:13:19,574 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 195 transitions. Word has length 27 [2025-04-13 22:13:19,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:19,574 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 195 transitions. [2025-04-13 22:13:19,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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:19,574 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 195 transitions. [2025-04-13 22:13:19,575 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:19,575 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:19,575 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:19,581 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:13:19,775 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,SelfDestructingSolverStorable19 [2025-04-13 22:13:19,775 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:13:19,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:19,776 INFO L85 PathProgramCache]: Analyzing trace with hash -455879895, now seen corresponding path program 12 times [2025-04-13 22:13:19,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:19,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209032546] [2025-04-13 22:13:19,776 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:19,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:19,782 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:19,794 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:19,795 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:19,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:20,063 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:20,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:20,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209032546] [2025-04-13 22:13:20,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209032546] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:20,064 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140254003] [2025-04-13 22:13:20,064 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:20,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:20,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:20,066 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:13:20,068 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:13:20,145 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:20,165 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:20,166 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:20,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:20,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:20,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:20,301 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:20,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:20,409 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:20,409 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 44 treesize of output 77 [2025-04-13 22:13:20,468 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:20,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140254003] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:20,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:20,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001132304] [2025-04-13 22:13:20,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:20,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:20,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:20,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:20,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:20,469 INFO L87 Difference]: Start difference. First operand 88 states and 195 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:13:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:20,641 INFO L93 Difference]: Finished difference Result 108 states and 241 transitions. [2025-04-13 22:13:20,642 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:13:20,642 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 27 [2025-04-13 22:13:20,642 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:20,642 INFO L225 Difference]: With dead ends: 108 [2025-04-13 22:13:20,642 INFO L226 Difference]: Without dead ends: 100 [2025-04-13 22:13:20,643 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:13:20,643 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:20,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-13 22:13:20,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2025-04-13 22:13:20,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 2.2413793103448274) internal successors, (195), 87 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call 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,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 195 transitions. [2025-04-13 22:13:20,659 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 195 transitions. Word has length 27 [2025-04-13 22:13:20,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:20,659 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 195 transitions. [2025-04-13 22:13:20,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:13:20,659 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 195 transitions. [2025-04-13 22:13:20,659 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:20,659 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:20,659 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:20,665 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:13:20,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:20,860 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:13:20,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:20,860 INFO L85 PathProgramCache]: Analyzing trace with hash -2059073246, now seen corresponding path program 13 times [2025-04-13 22:13:20,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:20,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822117153] [2025-04-13 22:13:20,860 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:20,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:20,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:20,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:20,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:20,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:21,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:21,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822117153] [2025-04-13 22:13:21,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822117153] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:21,190 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621915687] [2025-04-13 22:13:21,190 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:21,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:21,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:21,191 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:13:21,193 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:13:21,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:21,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:21,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:21,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:21,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:21,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:21,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:21,514 INFO L325 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2025-04-13 22:13:21,514 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 63 treesize of output 67 [2025-04-13 22:13:21,528 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:21,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621915687] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:21,528 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:21,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-04-13 22:13:21,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585732894] [2025-04-13 22:13:21,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:21,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:21,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:21,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:21,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:21,529 INFO L87 Difference]: Start difference. First operand 88 states and 195 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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:13:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:21,751 INFO L93 Difference]: Finished difference Result 120 states and 254 transitions. [2025-04-13 22:13:21,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:13:21,752 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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 27 [2025-04-13 22:13:21,752 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:21,752 INFO L225 Difference]: With dead ends: 120 [2025-04-13 22:13:21,752 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 22:13:21,753 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:13:21,753 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:21,754 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 0 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 22:13:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 90. [2025-04-13 22:13:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 2.247191011235955) internal successors, (200), 89 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call 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:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 200 transitions. [2025-04-13 22:13:21,766 INFO L79 Accepts]: Start accepts. Automaton has 90 states and 200 transitions. Word has length 27 [2025-04-13 22:13:21,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:21,766 INFO L485 AbstractCegarLoop]: Abstraction has 90 states and 200 transitions. [2025-04-13 22:13:21,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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:13:21,766 INFO L278 IsEmpty]: Start isEmpty. Operand 90 states and 200 transitions. [2025-04-13 22:13:21,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:21,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:21,766 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:21,773 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:13:21,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:21,967 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:13:21,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:21,967 INFO L85 PathProgramCache]: Analyzing trace with hash 2092536904, now seen corresponding path program 14 times [2025-04-13 22:13:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:21,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573560172] [2025-04-13 22:13:21,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:21,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:21,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:21,997 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:21,997 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:21,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:22,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573560172] [2025-04-13 22:13:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573560172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:22,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489565170] [2025-04-13 22:13:22,391 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:22,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:22,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:22,393 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:13:22,394 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:13:22,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:22,511 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:22,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:22,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:22,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:13:22,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:22,645 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:22,645 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 46 treesize of output 30 [2025-04-13 22:13:22,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:22,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:22,765 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:22,765 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 71 treesize of output 88 [2025-04-13 22:13:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:22,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489565170] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:22,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:22,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:22,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170024382] [2025-04-13 22:13:22,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:22,822 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:22,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:22,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:22,823 INFO L87 Difference]: Start difference. First operand 90 states and 200 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:23,114 INFO L93 Difference]: Finished difference Result 120 states and 262 transitions. [2025-04-13 22:13:23,114 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:13:23,114 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:23,115 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:23,115 INFO L225 Difference]: With dead ends: 120 [2025-04-13 22:13:23,115 INFO L226 Difference]: Without dead ends: 111 [2025-04-13 22:13:23,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:13:23,116 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:23,116 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:23,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-04-13 22:13:23,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2025-04-13 22:13:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.305263157894737) internal successors, (219), 95 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call 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:23,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 219 transitions. [2025-04-13 22:13:23,130 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 219 transitions. Word has length 27 [2025-04-13 22:13:23,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:23,130 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 219 transitions. [2025-04-13 22:13:23,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:23,130 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 219 transitions. [2025-04-13 22:13:23,131 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:23,131 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:23,131 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:23,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 22:13:23,334 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,SelfDestructingSolverStorable22 [2025-04-13 22:13:23,334 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:13:23,335 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1114311263, now seen corresponding path program 15 times [2025-04-13 22:13:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:23,335 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899890591] [2025-04-13 22:13:23,335 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:23,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:23,351 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:23,352 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:23,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:23,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:23,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899890591] [2025-04-13 22:13:23,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899890591] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:23,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451242323] [2025-04-13 22:13:23,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:23,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:23,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:23,682 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:23,684 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:23,764 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:23,787 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:23,787 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:23,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:23,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:23,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:23,925 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:23,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:24,031 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:13:24,031 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 32 treesize of output 48 [2025-04-13 22:13:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:24,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451242323] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:24,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:24,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 22:13:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335326630] [2025-04-13 22:13:24,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:24,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:24,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:24,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:24,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:24,056 INFO L87 Difference]: Start difference. First operand 96 states and 219 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 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:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:24,284 INFO L93 Difference]: Finished difference Result 143 states and 322 transitions. [2025-04-13 22:13:24,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:24,284 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 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 27 [2025-04-13 22:13:24,284 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:24,285 INFO L225 Difference]: With dead ends: 143 [2025-04-13 22:13:24,285 INFO L226 Difference]: Without dead ends: 135 [2025-04-13 22:13:24,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:13:24,285 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:24,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-13 22:13:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2025-04-13 22:13:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.305263157894737) internal successors, (219), 95 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call 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:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 219 transitions. [2025-04-13 22:13:24,301 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 219 transitions. Word has length 27 [2025-04-13 22:13:24,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:24,301 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 219 transitions. [2025-04-13 22:13:24,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 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:24,301 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 219 transitions. [2025-04-13 22:13:24,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:24,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:24,301 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:24,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:24,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:24,506 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:13:24,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash 2123013097, now seen corresponding path program 16 times [2025-04-13 22:13:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:24,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921488088] [2025-04-13 22:13:24,506 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:24,513 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:24,523 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:24,524 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:24,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:24,819 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:24,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:24,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921488088] [2025-04-13 22:13:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921488088] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:24,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519848681] [2025-04-13 22:13:24,820 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:24,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:24,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:24,821 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:24,824 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:24,925 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:24,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:24,970 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:24,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:24,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:24,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:25,045 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:25,045 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 46 treesize of output 34 [2025-04-13 22:13:25,077 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:25,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:25,167 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:25,167 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 44 treesize of output 77 [2025-04-13 22:13:25,192 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:25,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519848681] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:25,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:25,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-04-13 22:13:25,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144091397] [2025-04-13 22:13:25,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:25,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:13:25,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:25,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:13:25,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:13:25,193 INFO L87 Difference]: Start difference. First operand 96 states and 219 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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:13:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:25,482 INFO L93 Difference]: Finished difference Result 135 states and 302 transitions. [2025-04-13 22:13:25,482 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:25,482 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 27 [2025-04-13 22:13:25,482 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:25,483 INFO L225 Difference]: With dead ends: 135 [2025-04-13 22:13:25,483 INFO L226 Difference]: Without dead ends: 127 [2025-04-13 22:13:25,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:13:25,483 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:25,483 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-13 22:13:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 96. [2025-04-13 22:13:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 2.305263157894737) internal successors, (219), 95 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call 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,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 219 transitions. [2025-04-13 22:13:25,499 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 219 transitions. Word has length 27 [2025-04-13 22:13:25,499 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:25,499 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 219 transitions. [2025-04-13 22:13:25,499 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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:13:25,499 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 219 transitions. [2025-04-13 22:13:25,499 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:25,499 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:25,499 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:25,506 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:25,700 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:25,700 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:13:25,700 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:25,700 INFO L85 PathProgramCache]: Analyzing trace with hash 518144990, now seen corresponding path program 17 times [2025-04-13 22:13:25,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:25,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517547560] [2025-04-13 22:13:25,700 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:25,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:25,707 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:25,725 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:25,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:25,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:26,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:26,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517547560] [2025-04-13 22:13:26,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517547560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:26,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022327577] [2025-04-13 22:13:26,097 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:26,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:26,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:26,099 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:26,100 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:26,187 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:26,227 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:26,227 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:26,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:26,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:13:26,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:26,331 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:26,331 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 46 treesize of output 34 [2025-04-13 22:13:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:26,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:26,475 INFO L325 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2025-04-13 22:13:26,475 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 63 treesize of output 67 [2025-04-13 22:13:26,500 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:26,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022327577] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:26,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:26,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 22:13:26,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364772973] [2025-04-13 22:13:26,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:26,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:26,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:26,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:26,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:26,501 INFO L87 Difference]: Start difference. First operand 96 states and 219 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:26,839 INFO L93 Difference]: Finished difference Result 141 states and 308 transitions. [2025-04-13 22:13:26,839 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:26,840 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:26,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:26,840 INFO L225 Difference]: With dead ends: 141 [2025-04-13 22:13:26,840 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 22:13:26,841 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:13:26,841 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:26,841 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:26,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 22:13:26,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2025-04-13 22:13:26,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.329896907216495) internal successors, (226), 97 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call 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,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 226 transitions. [2025-04-13 22:13:26,859 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 226 transitions. Word has length 27 [2025-04-13 22:13:26,859 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:26,859 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 226 transitions. [2025-04-13 22:13:26,859 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:26,859 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 226 transitions. [2025-04-13 22:13:26,860 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:26,860 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:26,860 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:26,866 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:27,060 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:27,060 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:13:27,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash 2009509387, now seen corresponding path program 18 times [2025-04-13 22:13:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:27,061 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100701372] [2025-04-13 22:13:27,061 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:27,067 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:27,078 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:27,078 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:27,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:27,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:27,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100701372] [2025-04-13 22:13:27,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100701372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:27,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738978584] [2025-04-13 22:13:27,330 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:27,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:27,332 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:27,332 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:27,412 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:27,434 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:27,434 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:27,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:27,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:13:27,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:27,566 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:27,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 65 treesize of output 41 [2025-04-13 22:13:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:27,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:27,686 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:27,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 44 treesize of output 77 [2025-04-13 22:13:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738978584] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:27,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749165124] [2025-04-13 22:13:27,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:27,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:27,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:27,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:27,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:27,722 INFO L87 Difference]: Start difference. First operand 98 states and 226 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:13:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:27,980 INFO L93 Difference]: Finished difference Result 121 states and 273 transitions. [2025-04-13 22:13:27,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:13:27,981 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 27 [2025-04-13 22:13:27,981 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:27,981 INFO L225 Difference]: With dead ends: 121 [2025-04-13 22:13:27,981 INFO L226 Difference]: Without dead ends: 110 [2025-04-13 22:13:27,981 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:13:27,982 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:27,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 0 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:27,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-04-13 22:13:28,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2025-04-13 22:13:28,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.3092783505154637) internal successors, (224), 97 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call 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:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 224 transitions. [2025-04-13 22:13:28,006 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 224 transitions. Word has length 27 [2025-04-13 22:13:28,006 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:28,006 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 224 transitions. [2025-04-13 22:13:28,006 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:13:28,006 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 224 transitions. [2025-04-13 22:13:28,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:28,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:28,006 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:28,013 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:28,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 22:13:28,207 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:28,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:28,207 INFO L85 PathProgramCache]: Analyzing trace with hash 548621183, now seen corresponding path program 19 times [2025-04-13 22:13:28,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:28,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751259165] [2025-04-13 22:13:28,207 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:28,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:28,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:28,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:28,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:28,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:28,507 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:28,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:28,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751259165] [2025-04-13 22:13:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751259165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:28,507 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582768981] [2025-04-13 22:13:28,507 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:28,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:28,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:28,509 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:28,510 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:28,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:28,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:28,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:28,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:28,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:28,677 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:28,677 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 46 treesize of output 34 [2025-04-13 22:13:28,704 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:28,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:28,801 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:13:28,802 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 32 treesize of output 48 [2025-04-13 22:13:28,809 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:28,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582768981] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:28,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:28,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-04-13 22:13:28,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391983203] [2025-04-13 22:13:28,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:28,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:13:28,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:28,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:13:28,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:13:28,810 INFO L87 Difference]: Start difference. First operand 98 states and 224 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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:13:29,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:29,219 INFO L93 Difference]: Finished difference Result 152 states and 334 transitions. [2025-04-13 22:13:29,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:13:29,220 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 27 [2025-04-13 22:13:29,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:29,221 INFO L225 Difference]: With dead ends: 152 [2025-04-13 22:13:29,221 INFO L226 Difference]: Without dead ends: 144 [2025-04-13 22:13:29,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=134, Invalid=568, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:13:29,221 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:29,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:29,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-04-13 22:13:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2025-04-13 22:13:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.3092783505154637) internal successors, (224), 97 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call 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,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 224 transitions. [2025-04-13 22:13:29,240 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 224 transitions. Word has length 27 [2025-04-13 22:13:29,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:29,240 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 224 transitions. [2025-04-13 22:13:29,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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:13:29,240 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 224 transitions. [2025-04-13 22:13:29,240 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:29,240 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:29,241 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:29,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 22:13:29,441 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 22:13:29,441 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:29,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash 2037125644, now seen corresponding path program 20 times [2025-04-13 22:13:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:29,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437688674] [2025-04-13 22:13:29,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:29,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:29,463 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:29,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:29,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:13:30,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:30,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437688674] [2025-04-13 22:13:30,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437688674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:30,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021499883] [2025-04-13 22:13:30,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:30,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:30,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:30,102 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:30,104 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:30,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:30,247 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:30,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:30,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:30,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:13:30,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:30,385 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:30,385 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 46 treesize of output 30 [2025-04-13 22:13:30,421 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:30,421 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:30,521 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:30,521 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 71 treesize of output 88 [2025-04-13 22:13:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021499883] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:30,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:30,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 7] total 25 [2025-04-13 22:13:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850519994] [2025-04-13 22:13:30,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:30,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:13:30,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:30,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:13:30,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:13:30,589 INFO L87 Difference]: Start difference. First operand 98 states and 224 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:13:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:30,837 INFO L93 Difference]: Finished difference Result 114 states and 258 transitions. [2025-04-13 22:13:30,837 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:30,837 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 27 [2025-04-13 22:13:30,837 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:30,838 INFO L225 Difference]: With dead ends: 114 [2025-04-13 22:13:30,838 INFO L226 Difference]: Without dead ends: 107 [2025-04-13 22:13:30,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=887, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:13:30,839 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:30,839 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-13 22:13:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2025-04-13 22:13:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.3092783505154637) internal successors, (224), 97 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call 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:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 224 transitions. [2025-04-13 22:13:30,883 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 224 transitions. Word has length 27 [2025-04-13 22:13:30,883 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:30,884 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 224 transitions. [2025-04-13 22:13:30,884 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:13:30,884 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 224 transitions. [2025-04-13 22:13:30,884 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:30,884 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:30,884 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:30,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:31,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 22:13:31,085 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:31,085 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:31,085 INFO L85 PathProgramCache]: Analyzing trace with hash 435117473, now seen corresponding path program 21 times [2025-04-13 22:13:31,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:31,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764584708] [2025-04-13 22:13:31,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:31,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:31,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:31,103 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:31,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:31,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:31,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764584708] [2025-04-13 22:13:31,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764584708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:31,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197226649] [2025-04-13 22:13:31,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:31,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:31,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:31,404 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:31,406 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:31,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:31,519 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:31,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:31,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:31,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:13:31,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:31,657 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:31,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 65 treesize of output 41 [2025-04-13 22:13:31,679 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:31,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:31,800 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:13:31,800 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 32 treesize of output 48 [2025-04-13 22:13:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:31,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197226649] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:31,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:31,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 21 [2025-04-13 22:13:31,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161033618] [2025-04-13 22:13:31,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:31,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:13:31,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:31,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:13:31,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:13:31,825 INFO L87 Difference]: Start difference. First operand 98 states and 224 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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:13:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:32,183 INFO L93 Difference]: Finished difference Result 138 states and 305 transitions. [2025-04-13 22:13:32,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:32,184 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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 27 [2025-04-13 22:13:32,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:32,184 INFO L225 Difference]: With dead ends: 138 [2025-04-13 22:13:32,184 INFO L226 Difference]: Without dead ends: 127 [2025-04-13 22:13:32,185 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:13:32,185 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:32,185 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-13 22:13:32,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2025-04-13 22:13:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.288659793814433) internal successors, (222), 97 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call 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:32,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 222 transitions. [2025-04-13 22:13:32,205 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 222 transitions. Word has length 27 [2025-04-13 22:13:32,205 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:32,205 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 222 transitions. [2025-04-13 22:13:32,205 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 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:13:32,205 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 222 transitions. [2025-04-13 22:13:32,205 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:32,205 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:32,205 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:32,212 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:32,405 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:32,406 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:32,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:32,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1240981360, now seen corresponding path program 22 times [2025-04-13 22:13:32,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:32,406 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913467111] [2025-04-13 22:13:32,406 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:32,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:32,414 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:32,428 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:32,428 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:32,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:32,774 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:32,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:32,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913467111] [2025-04-13 22:13:32,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913467111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:32,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860426476] [2025-04-13 22:13:32,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:32,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:32,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:32,777 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:32,779 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:32,870 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:32,891 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:32,891 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:32,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:32,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:32,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:32,944 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:32,944 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 46 treesize of output 34 [2025-04-13 22:13:32,980 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:32,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:33,082 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:33,082 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 44 treesize of output 77 [2025-04-13 22:13:33,113 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:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860426476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:33,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:33,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-04-13 22:13:33,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162319953] [2025-04-13 22:13:33,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:33,114 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:33,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:33,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:33,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:33,115 INFO L87 Difference]: Start difference. First operand 98 states and 222 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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:13:33,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:33,334 INFO L93 Difference]: Finished difference Result 138 states and 308 transitions. [2025-04-13 22:13:33,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:33,335 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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 27 [2025-04-13 22:13:33,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:33,335 INFO L225 Difference]: With dead ends: 138 [2025-04-13 22:13:33,335 INFO L226 Difference]: Without dead ends: 129 [2025-04-13 22:13:33,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:13:33,336 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:33,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-13 22:13:33,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 104. [2025-04-13 22:13:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.3592233009708736) internal successors, (243), 103 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call 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,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 243 transitions. [2025-04-13 22:13:33,357 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 243 transitions. Word has length 27 [2025-04-13 22:13:33,357 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:33,357 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 243 transitions. [2025-04-13 22:13:33,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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:13:33,357 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 243 transitions. [2025-04-13 22:13:33,357 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:33,357 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:33,357 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,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:33,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:33,557 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:33,558 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:33,558 INFO L85 PathProgramCache]: Analyzing trace with hash 462733730, now seen corresponding path program 23 times [2025-04-13 22:13:33,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:33,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759777267] [2025-04-13 22:13:33,558 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:33,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:33,564 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:33,576 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:33,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:33,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:33,909 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:33,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:33,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759777267] [2025-04-13 22:13:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759777267] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:33,910 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948276578] [2025-04-13 22:13:33,910 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:33,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:33,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:33,912 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:33,912 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:34,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:34,043 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:34,043 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:34,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:34,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:13:34,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:34,130 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:34,130 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 65 treesize of output 45 [2025-04-13 22:13:34,162 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,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:34,264 INFO L325 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2025-04-13 22:13:34,264 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 63 treesize of output 67 [2025-04-13 22:13:34,292 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948276578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:34,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:34,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2025-04-13 22:13:34,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534731607] [2025-04-13 22:13:34,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:34,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:34,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:34,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:34,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:34,293 INFO L87 Difference]: Start difference. First operand 104 states and 243 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:34,558 INFO L93 Difference]: Finished difference Result 137 states and 311 transitions. [2025-04-13 22:13:34,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:13:34,559 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:34,559 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:34,559 INFO L225 Difference]: With dead ends: 137 [2025-04-13 22:13:34,560 INFO L226 Difference]: Without dead ends: 130 [2025-04-13 22:13:34,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:13:34,560 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:34,560 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-04-13 22:13:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 100. [2025-04-13 22:13:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.3535353535353534) internal successors, (233), 99 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call 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:34,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 233 transitions. [2025-04-13 22:13:34,589 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 233 transitions. Word has length 27 [2025-04-13 22:13:34,589 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:34,589 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 233 transitions. [2025-04-13 22:13:34,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:34,589 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 233 transitions. [2025-04-13 22:13:34,590 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:34,590 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:34,590 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:34,596 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:34,790 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,SelfDestructingSolverStorable31 [2025-04-13 22:13:34,790 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:34,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1271457553, now seen corresponding path program 24 times [2025-04-13 22:13:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:34,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534601606] [2025-04-13 22:13:34,791 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:34,797 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:34,809 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:34,809 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:13:34,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:35,680 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:13:35,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:35,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534601606] [2025-04-13 22:13:35,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534601606] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:35,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504755139] [2025-04-13 22:13:35,681 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:35,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:35,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:35,683 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:35,684 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:35,778 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:35,805 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:35,805 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:13:35,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:35,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:35,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:35,966 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:35,966 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 65 treesize of output 41 [2025-04-13 22:13:35,999 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:36,000 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:36,104 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:36,104 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 71 treesize of output 88 [2025-04-13 22:13:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:36,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504755139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:36,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 7] total 32 [2025-04-13 22:13:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999720412] [2025-04-13 22:13:36,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:36,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:13:36,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:36,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:13:36,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:13:36,194 INFO L87 Difference]: Start difference. First operand 100 states and 233 transitions. Second operand has 32 states, 32 states have (on average 1.84375) 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:13:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:36,734 INFO L93 Difference]: Finished difference Result 139 states and 311 transitions. [2025-04-13 22:13:36,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:13:36,735 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.84375) 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 27 [2025-04-13 22:13:36,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:36,735 INFO L225 Difference]: With dead ends: 139 [2025-04-13 22:13:36,735 INFO L226 Difference]: Without dead ends: 131 [2025-04-13 22:13:36,736 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:13:36,736 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:36,736 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:36,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-13 22:13:36,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 100. [2025-04-13 22:13:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.3535353535353534) internal successors, (233), 99 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call 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,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 233 transitions. [2025-04-13 22:13:36,757 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 233 transitions. Word has length 27 [2025-04-13 22:13:36,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:36,757 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 233 transitions. [2025-04-13 22:13:36,758 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.84375) 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:13:36,758 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 233 transitions. [2025-04-13 22:13:36,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:36,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:36,758 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,765 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:36,961 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,SelfDestructingSolverStorable32 [2025-04-13 22:13:36,961 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:36,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:36,961 INFO L85 PathProgramCache]: Analyzing trace with hash 118070966, now seen corresponding path program 25 times [2025-04-13 22:13:36,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:36,961 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540400884] [2025-04-13 22:13:36,961 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:36,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:36,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:36,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:36,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:36,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:37,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:37,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540400884] [2025-04-13 22:13:37,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540400884] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:37,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788237425] [2025-04-13 22:13:37,257 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:37,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:37,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:37,259 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:37,260 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:37,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:37,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:37,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:37,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:37,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:37,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:37,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:37,504 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:37,504 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 71 treesize of output 88 [2025-04-13 22:13:37,542 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:37,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788237425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:37,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:37,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-04-13 22:13:37,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231452668] [2025-04-13 22:13:37,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:37,543 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:37,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:37,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:37,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:37,543 INFO L87 Difference]: Start difference. First operand 100 states and 233 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 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:13:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:37,714 INFO L93 Difference]: Finished difference Result 116 states and 260 transitions. [2025-04-13 22:13:37,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:13:37,714 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 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 27 [2025-04-13 22:13:37,714 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:37,715 INFO L225 Difference]: With dead ends: 116 [2025-04-13 22:13:37,715 INFO L226 Difference]: Without dead ends: 105 [2025-04-13 22:13:37,715 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:13:37,715 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:37,715 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:37,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-04-13 22:13:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 100. [2025-04-13 22:13:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.3333333333333335) internal successors, (231), 99 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call 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,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 231 transitions. [2025-04-13 22:13:37,737 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 231 transitions. Word has length 27 [2025-04-13 22:13:37,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:37,737 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 231 transitions. [2025-04-13 22:13:37,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 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:13:37,737 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 231 transitions. [2025-04-13 22:13:37,737 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:37,737 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:37,737 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,745 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:37,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:37,938 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:37,938 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:37,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1157953843, now seen corresponding path program 26 times [2025-04-13 22:13:37,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:37,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286693698] [2025-04-13 22:13:37,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:37,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:37,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:37,955 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:37,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:37,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:38,256 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:38,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:38,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286693698] [2025-04-13 22:13:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286693698] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:38,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703143976] [2025-04-13 22:13:38,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:38,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:38,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:38,258 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:38,260 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:38,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:38,387 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:38,387 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:38,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:38,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:38,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:38,494 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:38,495 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 65 treesize of output 41 [2025-04-13 22:13:38,517 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:38,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:38,594 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:38,595 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 71 treesize of output 88 [2025-04-13 22:13:38,653 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:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703143976] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:38,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:38,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:38,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138752405] [2025-04-13 22:13:38,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:38,653 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:38,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:38,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:38,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:38,654 INFO L87 Difference]: Start difference. First operand 100 states and 231 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:39,024 INFO L93 Difference]: Finished difference Result 139 states and 305 transitions. [2025-04-13 22:13:39,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:13:39,025 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:39,025 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:39,025 INFO L225 Difference]: With dead ends: 139 [2025-04-13 22:13:39,025 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 22:13:39,026 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=658, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:13:39,026 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:39,026 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 22:13:39,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 100. [2025-04-13 22:13:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.313131313131313) internal successors, (229), 99 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call 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,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 229 transitions. [2025-04-13 22:13:39,049 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 229 transitions. Word has length 27 [2025-04-13 22:13:39,049 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:39,049 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 229 transitions. [2025-04-13 22:13:39,050 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:39,050 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 229 transitions. [2025-04-13 22:13:39,050 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:39,050 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:39,050 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,056 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:39,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:39,250 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:39,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:39,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1062832949, now seen corresponding path program 27 times [2025-04-13 22:13:39,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:39,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872830373] [2025-04-13 22:13:39,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:39,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:39,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:39,266 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:39,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:39,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:39,499 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:39,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:39,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872830373] [2025-04-13 22:13:39,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872830373] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:39,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393681977] [2025-04-13 22:13:39,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:39,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:39,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:39,501 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:39,502 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:39,600 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:39,619 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:39,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:39,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:39,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:13:39,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:39,751 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,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:39,829 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:39,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 44 treesize of output 77 [2025-04-13 22:13:39,873 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:39,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393681977] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:39,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:39,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:39,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642034891] [2025-04-13 22:13:39,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:39,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:39,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:39,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:39,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:39,874 INFO L87 Difference]: Start difference. First operand 100 states and 229 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:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:40,088 INFO L93 Difference]: Finished difference Result 121 states and 277 transitions. [2025-04-13 22:13:40,088 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:13:40,088 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:40,088 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:40,088 INFO L225 Difference]: With dead ends: 121 [2025-04-13 22:13:40,088 INFO L226 Difference]: Without dead ends: 113 [2025-04-13 22:13:40,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:13:40,089 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:40,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-13 22:13:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2025-04-13 22:13:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.313131313131313) internal successors, (229), 99 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call 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,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 229 transitions. [2025-04-13 22:13:40,112 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 229 transitions. Word has length 27 [2025-04-13 22:13:40,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:40,112 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 229 transitions. [2025-04-13 22:13:40,112 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:40,112 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 229 transitions. [2025-04-13 22:13:40,112 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:40,112 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:40,112 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,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 22:13:40,313 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:40,313 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:40,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:40,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1185570100, now seen corresponding path program 28 times [2025-04-13 22:13:40,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:40,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855272053] [2025-04-13 22:13:40,313 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:40,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:40,320 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:40,335 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:40,335 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:40,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:40,687 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:40,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:40,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855272053] [2025-04-13 22:13:40,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855272053] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:40,687 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879708862] [2025-04-13 22:13:40,687 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:40,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:40,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:40,689 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:40,689 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:40,791 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:40,813 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:40,813 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:40,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:40,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:40,858 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:40,858 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 46 treesize of output 34 [2025-04-13 22:13:40,893 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:40,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:40,983 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:40,983 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 44 treesize of output 77 [2025-04-13 22:13:41,021 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:41,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879708862] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:41,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:41,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-04-13 22:13:41,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926570040] [2025-04-13 22:13:41,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:41,022 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:41,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:41,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:41,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:41,022 INFO L87 Difference]: Start difference. First operand 100 states and 229 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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:13:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:41,356 INFO L93 Difference]: Finished difference Result 134 states and 297 transitions. [2025-04-13 22:13:41,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:41,357 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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 27 [2025-04-13 22:13:41,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:41,357 INFO L225 Difference]: With dead ends: 134 [2025-04-13 22:13:41,357 INFO L226 Difference]: Without dead ends: 127 [2025-04-13 22:13:41,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:13:41,358 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:41,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:41,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-13 22:13:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 98. [2025-04-13 22:13:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.3092783505154637) internal successors, (224), 97 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call 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:41,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 224 transitions. [2025-04-13 22:13:41,381 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 224 transitions. Word has length 27 [2025-04-13 22:13:41,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:41,381 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 224 transitions. [2025-04-13 22:13:41,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 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:13:41,381 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 224 transitions. [2025-04-13 22:13:41,382 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:41,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:41,382 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:41,388 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:41,582 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,SelfDestructingSolverStorable36 [2025-04-13 22:13:41,582 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:41,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1599678094, now seen corresponding path program 29 times [2025-04-13 22:13:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:41,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624933188] [2025-04-13 22:13:41,583 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:41,590 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:41,604 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:41,604 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:41,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:41,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:41,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624933188] [2025-04-13 22:13:41,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624933188] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:41,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978217643] [2025-04-13 22:13:41,962 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:41,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:41,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:41,964 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:41,965 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:42,074 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:42,148 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:42,148 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:42,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:42,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:13:42,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:42,229 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:42,229 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 46 treesize of output 34 [2025-04-13 22:13:42,263 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:42,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:42,353 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:42,353 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 71 treesize of output 88 [2025-04-13 22:13:42,396 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:42,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978217643] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:42,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:42,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 22 [2025-04-13 22:13:42,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053838288] [2025-04-13 22:13:42,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:42,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:13:42,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:42,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:13:42,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:42,397 INFO L87 Difference]: Start difference. First operand 98 states and 224 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 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:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:42,710 INFO L93 Difference]: Finished difference Result 129 states and 288 transitions. [2025-04-13 22:13:42,711 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:42,711 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 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:42,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:42,711 INFO L225 Difference]: With dead ends: 129 [2025-04-13 22:13:42,711 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 22:13:42,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=733, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:13:42,712 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:42,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 22:13:42,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2025-04-13 22:13:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.376237623762376) internal successors, (240), 101 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call 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,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 240 transitions. [2025-04-13 22:13:42,736 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 240 transitions. Word has length 27 [2025-04-13 22:13:42,736 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:42,736 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 240 transitions. [2025-04-13 22:13:42,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 22 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:42,736 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 240 transitions. [2025-04-13 22:13:42,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:42,736 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:42,737 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,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 22:13:42,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 22:13:42,937 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:42,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:42,937 INFO L85 PathProgramCache]: Analyzing trace with hash 2017423019, now seen corresponding path program 30 times [2025-04-13 22:13:42,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:42,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498807358] [2025-04-13 22:13:42,937 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:42,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:42,944 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:42,953 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:42,953 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:42,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:43,219 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:43,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:43,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498807358] [2025-04-13 22:13:43,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498807358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:43,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744866932] [2025-04-13 22:13:43,219 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:43,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:43,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:43,221 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:43,222 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:43,333 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:43,354 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:43,354 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:43,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:43,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:43,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:43,474 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:43,558 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:43,558 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 71 treesize of output 88 [2025-04-13 22:13:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744866932] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:43,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 22:13:43,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389786491] [2025-04-13 22:13:43,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:43,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:43,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:43,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:43,635 INFO L87 Difference]: Start difference. First operand 102 states and 240 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:43,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:43,855 INFO L93 Difference]: Finished difference Result 118 states and 267 transitions. [2025-04-13 22:13:43,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:13:43,855 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:43,855 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:43,856 INFO L225 Difference]: With dead ends: 118 [2025-04-13 22:13:43,856 INFO L226 Difference]: Without dead ends: 104 [2025-04-13 22:13:43,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:13:43,856 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:43,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:43,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-04-13 22:13:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2025-04-13 22:13:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.3564356435643563) internal successors, (238), 101 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call 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:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 238 transitions. [2025-04-13 22:13:43,881 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 238 transitions. Word has length 27 [2025-04-13 22:13:43,881 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:43,881 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 238 transitions. [2025-04-13 22:13:43,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:43,881 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 238 transitions. [2025-04-13 22:13:43,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:43,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:43,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:43,887 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:44,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 22:13:44,082 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:44,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:44,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1569201901, now seen corresponding path program 31 times [2025-04-13 22:13:44,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:44,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038571361] [2025-04-13 22:13:44,082 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:44,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:44,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:44,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:44,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:44,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:44,377 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:44,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:44,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038571361] [2025-04-13 22:13:44,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038571361] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:44,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576224338] [2025-04-13 22:13:44,377 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:44,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:44,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:44,379 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:44,380 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:44,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:44,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:44,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:44,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:44,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:44,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:44,549 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:44,550 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 46 treesize of output 34 [2025-04-13 22:13:44,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:13:44,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:44,662 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:44,662 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 44 treesize of output 77 [2025-04-13 22:13:44,687 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:44,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576224338] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:44,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:44,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-04-13 22:13:44,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054914139] [2025-04-13 22:13:44,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:44,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:13:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:44,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:13:44,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:13:44,688 INFO L87 Difference]: Start difference. First operand 102 states and 238 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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:13:45,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:45,006 INFO L93 Difference]: Finished difference Result 142 states and 323 transitions. [2025-04-13 22:13:45,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:13:45,006 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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 27 [2025-04-13 22:13:45,006 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:45,007 INFO L225 Difference]: With dead ends: 142 [2025-04-13 22:13:45,007 INFO L226 Difference]: Without dead ends: 134 [2025-04-13 22:13:45,007 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:13:45,008 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:45,008 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-04-13 22:13:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 102. [2025-04-13 22:13:45,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.3564356435643563) internal successors, (238), 101 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call 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,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 238 transitions. [2025-04-13 22:13:45,032 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 238 transitions. Word has length 27 [2025-04-13 22:13:45,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:45,033 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 238 transitions. [2025-04-13 22:13:45,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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:13:45,033 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 238 transitions. [2025-04-13 22:13:45,033 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:45,033 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:45,033 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:45,039 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:45,233 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,SelfDestructingSolverStorable39 [2025-04-13 22:13:45,233 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:45,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:45,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1391053490, now seen corresponding path program 32 times [2025-04-13 22:13:45,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:45,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688352522] [2025-04-13 22:13:45,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:45,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:45,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:45,250 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:45,251 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:45,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:45,550 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:45,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:45,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688352522] [2025-04-13 22:13:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688352522] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:45,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785182113] [2025-04-13 22:13:45,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:45,552 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:45,554 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:45,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:45,688 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:45,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:45,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:45,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:13:45,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:45,760 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:45,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:45,835 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:45,835 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 44 treesize of output 77 [2025-04-13 22:13:45,878 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:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785182113] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:45,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:45,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 17 [2025-04-13 22:13:45,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529207722] [2025-04-13 22:13:45,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:45,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 22:13:45,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:45,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 22:13:45,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-04-13 22:13:45,879 INFO L87 Difference]: Start difference. First operand 102 states and 238 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:46,085 INFO L93 Difference]: Finished difference Result 120 states and 270 transitions. [2025-04-13 22:13:46,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:13:46,085 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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:46,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:46,086 INFO L225 Difference]: With dead ends: 120 [2025-04-13 22:13:46,086 INFO L226 Difference]: Without dead ends: 113 [2025-04-13 22:13:46,086 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:46,086 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:46,086 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 0 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:46,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-13 22:13:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2025-04-13 22:13:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.313131313131313) internal successors, (229), 99 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call 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,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 229 transitions. [2025-04-13 22:13:46,117 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 229 transitions. Word has length 27 [2025-04-13 22:13:46,117 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:46,117 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 229 transitions. [2025-04-13 22:13:46,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 17 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:46,117 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 229 transitions. [2025-04-13 22:13:46,117 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:46,117 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:46,117 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,124 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:46,318 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:46,318 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:46,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1682705611, now seen corresponding path program 33 times [2025-04-13 22:13:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:46,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870251807] [2025-04-13 22:13:46,318 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:46,325 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:46,333 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:46,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:46,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:46,570 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:46,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:46,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870251807] [2025-04-13 22:13:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870251807] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:46,570 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080750249] [2025-04-13 22:13:46,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:46,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:46,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:46,572 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:46,573 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:46,689 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:46,709 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:46,709 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:13:46,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:46,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:46,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:46,785 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:46,785 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 65 treesize of output 41 [2025-04-13 22:13:46,805 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:46,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:46,884 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:46,884 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 44 treesize of output 77 [2025-04-13 22:13:46,930 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:46,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080750249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:46,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:46,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 22:13:46,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144970328] [2025-04-13 22:13:46,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:46,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:46,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:46,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:46,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:46,931 INFO L87 Difference]: Start difference. First operand 100 states and 229 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:47,158 INFO L93 Difference]: Finished difference Result 124 states and 278 transitions. [2025-04-13 22:13:47,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:13:47,159 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:47,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:47,159 INFO L225 Difference]: With dead ends: 124 [2025-04-13 22:13:47,159 INFO L226 Difference]: Without dead ends: 113 [2025-04-13 22:13:47,160 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:13:47,160 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:47,160 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-04-13 22:13:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 100. [2025-04-13 22:13:47,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 2.292929292929293) internal successors, (227), 99 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call 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,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 227 transitions. [2025-04-13 22:13:47,185 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 227 transitions. Word has length 27 [2025-04-13 22:13:47,185 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:47,185 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 227 transitions. [2025-04-13 22:13:47,185 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:47,185 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 227 transitions. [2025-04-13 22:13:47,186 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:47,186 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:47,186 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:47,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 22:13:47,386 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,SelfDestructingSolverStorable41 [2025-04-13 22:13:47,386 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:47,387 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:47,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1028882888, now seen corresponding path program 34 times [2025-04-13 22:13:47,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:47,387 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049679058] [2025-04-13 22:13:47,387 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:47,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:47,395 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:47,406 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:47,406 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:47,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:47,890 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:13:47,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:47,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049679058] [2025-04-13 22:13:47,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049679058] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:47,890 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494607688] [2025-04-13 22:13:47,890 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:47,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:47,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:47,892 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:47,893 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:48,007 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:48,029 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:48,029 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:48,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:48,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:48,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:48,077 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:48,077 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 46 treesize of output 34 [2025-04-13 22:13:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:48,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:48,199 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:13:48,199 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 32 treesize of output 48 [2025-04-13 22:13:48,207 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:48,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494607688] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:48,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:48,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 24 [2025-04-13 22:13:48,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925941466] [2025-04-13 22:13:48,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:48,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:13:48,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:48,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:13:48,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:13:48,208 INFO L87 Difference]: Start difference. First operand 100 states and 227 transitions. Second operand has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 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:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:48,691 INFO L93 Difference]: Finished difference Result 154 states and 339 transitions. [2025-04-13 22:13:48,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:13:48,692 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 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:48,692 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:48,692 INFO L225 Difference]: With dead ends: 154 [2025-04-13 22:13:48,693 INFO L226 Difference]: Without dead ends: 145 [2025-04-13 22:13:48,693 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=1103, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:13:48,693 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:48,693 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:48,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-04-13 22:13:48,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 106. [2025-04-13 22:13:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.361904761904762) internal successors, (248), 105 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call 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:48,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 248 transitions. [2025-04-13 22:13:48,723 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 248 transitions. Word has length 27 [2025-04-13 22:13:48,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:48,723 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 248 transitions. [2025-04-13 22:13:48,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 24 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:48,723 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 248 transitions. [2025-04-13 22:13:48,724 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:48,724 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:48,724 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:48,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 22:13:48,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:48,924 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:48,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:48,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1655089354, now seen corresponding path program 35 times [2025-04-13 22:13:48,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:48,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739838737] [2025-04-13 22:13:48,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:48,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:48,932 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:48,947 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:48,947 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:48,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:49,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739838737] [2025-04-13 22:13:49,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739838737] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:49,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112989459] [2025-04-13 22:13:49,210 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:49,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:49,212 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:49,213 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:49,327 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:49,375 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:49,375 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:49,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:49,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:13:49,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:49,464 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:49,464 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 65 treesize of output 41 [2025-04-13 22:13:49,491 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:49,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:49,576 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:49,577 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 71 treesize of output 88 [2025-04-13 22:13:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112989459] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:49,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:49,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 22 [2025-04-13 22:13:49,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973947771] [2025-04-13 22:13:49,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:49,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 22:13:49,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:49,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 22:13:49,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-04-13 22:13:49,615 INFO L87 Difference]: Start difference. First operand 106 states and 248 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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:13:49,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:49,869 INFO L93 Difference]: Finished difference Result 123 states and 284 transitions. [2025-04-13 22:13:49,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 22:13:49,870 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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 27 [2025-04-13 22:13:49,870 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:49,870 INFO L225 Difference]: With dead ends: 123 [2025-04-13 22:13:49,870 INFO L226 Difference]: Without dead ends: 116 [2025-04-13 22:13:49,870 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=544, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:13:49,871 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:49,871 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-04-13 22:13:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2025-04-13 22:13:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.3564356435643563) internal successors, (238), 101 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call 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,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 238 transitions. [2025-04-13 22:13:49,899 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 238 transitions. Word has length 27 [2025-04-13 22:13:49,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:49,899 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 238 transitions. [2025-04-13 22:13:49,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 22 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:13:49,899 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 238 transitions. [2025-04-13 22:13:49,899 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:49,899 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:49,899 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:49,906 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:50,099 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:50,100 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:50,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1059359081, now seen corresponding path program 36 times [2025-04-13 22:13:50,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:50,100 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010687658] [2025-04-13 22:13:50,100 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:50,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:50,107 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:50,116 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:50,116 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:50,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:50,439 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:50,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:50,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010687658] [2025-04-13 22:13:50,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010687658] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:50,439 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155670740] [2025-04-13 22:13:50,439 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:50,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:50,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:50,443 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:50,444 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:50,575 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:50,598 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:50,598 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:50,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:50,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:50,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:50,736 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:50,736 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 65 treesize of output 41 [2025-04-13 22:13:50,762 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:50,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:50,872 INFO L325 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2025-04-13 22:13:50,872 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 63 treesize of output 67 [2025-04-13 22:13:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:50,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155670740] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:50,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:50,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344780783] [2025-04-13 22:13:50,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:50,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:50,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:50,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:50,915 INFO L87 Difference]: Start difference. First operand 102 states and 238 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:13:51,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:51,636 INFO L93 Difference]: Finished difference Result 158 states and 352 transitions. [2025-04-13 22:13:51,636 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:13:51,636 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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 27 [2025-04-13 22:13:51,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:51,637 INFO L225 Difference]: With dead ends: 158 [2025-04-13 22:13:51,637 INFO L226 Difference]: Without dead ends: 150 [2025-04-13 22:13:51,638 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=838, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:13:51,638 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:51,638 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-13 22:13:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2025-04-13 22:13:51,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.3564356435643563) internal successors, (238), 101 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call 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:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 238 transitions. [2025-04-13 22:13:51,672 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 238 transitions. Word has length 27 [2025-04-13 22:13:51,672 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:51,672 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 238 transitions. [2025-04-13 22:13:51,672 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 20 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:13:51,672 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 238 transitions. [2025-04-13 22:13:51,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:51,672 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:51,672 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:51,679 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:51,873 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,SelfDestructingSolverStorable44 [2025-04-13 22:13:51,873 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:51,873 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash 129369240, now seen corresponding path program 37 times [2025-04-13 22:13:51,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:51,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188764202] [2025-04-13 22:13:51,873 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:51,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:51,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:51,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:51,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:52,167 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:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:52,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188764202] [2025-04-13 22:13:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188764202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:52,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421485011] [2025-04-13 22:13:52,167 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:13:52,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:52,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:52,169 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:52,170 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:52,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:13:52,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:52,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:13:52,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:52,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:52,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:52,361 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:52,361 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 46 treesize of output 34 [2025-04-13 22:13:52,389 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:52,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:52,471 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:52,471 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 44 treesize of output 77 [2025-04-13 22:13:52,495 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:52,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421485011] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:52,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:52,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2025-04-13 22:13:52,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904521165] [2025-04-13 22:13:52,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:52,495 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:52,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:52,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:52,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:52,496 INFO L87 Difference]: Start difference. First operand 102 states and 238 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 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:13:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:52,727 INFO L93 Difference]: Finished difference Result 137 states and 303 transitions. [2025-04-13 22:13:52,728 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:13:52,728 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 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 27 [2025-04-13 22:13:52,728 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:52,728 INFO L225 Difference]: With dead ends: 137 [2025-04-13 22:13:52,728 INFO L226 Difference]: Without dead ends: 128 [2025-04-13 22:13:52,729 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:13:52,729 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:52,729 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:13:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-04-13 22:13:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2025-04-13 22:13:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.3366336633663365) internal successors, (236), 101 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call 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:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 236 transitions. [2025-04-13 22:13:52,759 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 236 transitions. Word has length 27 [2025-04-13 22:13:52,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:52,759 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 236 transitions. [2025-04-13 22:13:52,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 19 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:13:52,759 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 236 transitions. [2025-04-13 22:13:52,759 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:52,759 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:52,759 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:52,766 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:52,960 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,SelfDestructingSolverStorable45 [2025-04-13 22:13:52,960 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:52,960 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:52,960 INFO L85 PathProgramCache]: Analyzing trace with hash 945855371, now seen corresponding path program 38 times [2025-04-13 22:13:52,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:52,960 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676120752] [2025-04-13 22:13:52,960 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:52,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:52,967 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:52,984 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:52,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:52,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:53,315 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:53,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:53,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676120752] [2025-04-13 22:13:53,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676120752] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:53,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145953494] [2025-04-13 22:13:53,316 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:13:53,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:53,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:53,318 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:53,319 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:53,451 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:53,474 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:53,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:13:53,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:53,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:53,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:53,600 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:53,600 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 65 treesize of output 41 [2025-04-13 22:13:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:53,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:53,717 INFO L325 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2025-04-13 22:13:53,717 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 63 treesize of output 67 [2025-04-13 22:13:53,757 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:53,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145953494] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:53,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:53,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:13:53,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979009691] [2025-04-13 22:13:53,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:53,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:13:53,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:53,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:13:53,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:13:53,758 INFO L87 Difference]: Start difference. First operand 102 states and 236 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:54,542 INFO L93 Difference]: Finished difference Result 157 states and 341 transitions. [2025-04-13 22:13:54,542 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:13:54,542 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:54,542 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:54,543 INFO L225 Difference]: With dead ends: 157 [2025-04-13 22:13:54,543 INFO L226 Difference]: Without dead ends: 146 [2025-04-13 22:13:54,543 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:13:54,544 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:54,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:54,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-13 22:13:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 102. [2025-04-13 22:13:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 2.3168316831683167) internal successors, (234), 101 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call 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:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 234 transitions. [2025-04-13 22:13:54,574 INFO L79 Accepts]: Start accepts. Automaton has 102 states and 234 transitions. Word has length 27 [2025-04-13 22:13:54,574 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:54,574 INFO L485 AbstractCegarLoop]: Abstraction has 102 states and 234 transitions. [2025-04-13 22:13:54,574 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 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:54,574 INFO L278 IsEmpty]: Start isEmpty. Operand 102 states and 234 transitions. [2025-04-13 22:13:54,575 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:54,575 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:54,575 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:54,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:54,775 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,SelfDestructingSolverStorable46 [2025-04-13 22:13:54,775 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:54,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:54,775 INFO L85 PathProgramCache]: Analyzing trace with hash 159845433, now seen corresponding path program 39 times [2025-04-13 22:13:54,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:54,776 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938617560] [2025-04-13 22:13:54,776 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:54,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:54,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:54,794 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 27 statements. [2025-04-13 22:13:54,794 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:13:54,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:55,071 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:55,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:55,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938617560] [2025-04-13 22:13:55,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938617560] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:55,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347986742] [2025-04-13 22:13:55,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:13:55,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:55,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:55,073 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:55,074 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:55,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:55,222 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 27 statements. [2025-04-13 22:13:55,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:13:55,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:55,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:13:55,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:55,353 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:55,353 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 65 treesize of output 41 [2025-04-13 22:13:55,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:13:55,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:55,525 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:55,526 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 71 treesize of output 88 [2025-04-13 22:13:55,591 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:55,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347986742] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:55,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:55,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 23 [2025-04-13 22:13:55,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795534304] [2025-04-13 22:13:55,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:55,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:13:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:55,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:13:55,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:13:55,592 INFO L87 Difference]: Start difference. First operand 102 states and 234 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:13:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:56,100 INFO L93 Difference]: Finished difference Result 177 states and 372 transitions. [2025-04-13 22:13:56,100 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:13:56,100 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 27 [2025-04-13 22:13:56,100 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:56,101 INFO L225 Difference]: With dead ends: 177 [2025-04-13 22:13:56,101 INFO L226 Difference]: Without dead ends: 167 [2025-04-13 22:13:56,101 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:13:56,101 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:56,102 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-04-13 22:13:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 104. [2025-04-13 22:13:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 103 states have (on average 2.3398058252427183) internal successors, (241), 103 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call 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:56,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 241 transitions. [2025-04-13 22:13:56,141 INFO L79 Accepts]: Start accepts. Automaton has 104 states and 241 transitions. Word has length 27 [2025-04-13 22:13:56,142 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:56,142 INFO L485 AbstractCegarLoop]: Abstraction has 104 states and 241 transitions. [2025-04-13 22:13:56,142 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:13:56,142 INFO L278 IsEmpty]: Start isEmpty. Operand 104 states and 241 transitions. [2025-04-13 22:13:56,142 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:56,142 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:56,142 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:56,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-04-13 22:13:56,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 22:13:56,342 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:56,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:56,343 INFO L85 PathProgramCache]: Analyzing trace with hash 973471628, now seen corresponding path program 40 times [2025-04-13 22:13:56,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:56,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810243960] [2025-04-13 22:13:56,343 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:56,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:56,350 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:56,363 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:56,363 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:56,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:56,647 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:56,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:56,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810243960] [2025-04-13 22:13:56,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810243960] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:56,648 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192393309] [2025-04-13 22:13:56,648 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:13:56,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:56,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:56,650 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:13:56,650 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:13:56,777 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:13:56,799 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:13:56,800 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:13:56,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:56,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:13:56,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:56,848 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:56,848 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 46 treesize of output 34 [2025-04-13 22:13:56,875 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:56,875 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:56,964 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:13:56,964 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 32 treesize of output 48 [2025-04-13 22:13:56,972 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:56,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192393309] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:56,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:56,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-04-13 22:13:56,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932181779] [2025-04-13 22:13:56,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:56,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:13:56,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:56,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:13:56,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:13:56,973 INFO L87 Difference]: Start difference. First operand 104 states and 241 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 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:57,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:57,369 INFO L93 Difference]: Finished difference Result 153 states and 333 transitions. [2025-04-13 22:13:57,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:13:57,369 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 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:57,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:57,370 INFO L225 Difference]: With dead ends: 153 [2025-04-13 22:13:57,370 INFO L226 Difference]: Without dead ends: 146 [2025-04-13 22:13:57,371 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:13:57,371 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:57,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-04-13 22:13:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 106. [2025-04-13 22:13:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.4) internal successors, (252), 105 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call 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,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 252 transitions. [2025-04-13 22:13:57,405 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 252 transitions. Word has length 27 [2025-04-13 22:13:57,405 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:57,405 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 252 transitions. [2025-04-13 22:13:57,405 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 18 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:57,405 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 252 transitions. [2025-04-13 22:13:57,405 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:57,405 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:57,405 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:57,412 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:13:57,606 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:57,606 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:57,606 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash 46341723, now seen corresponding path program 41 times [2025-04-13 22:13:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:57,606 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813533507] [2025-04-13 22:13:57,606 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:57,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:57,613 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:57,625 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:57,625 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:57,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:13:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:57,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813533507] [2025-04-13 22:13:57,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813533507] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:57,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394524750] [2025-04-13 22:13:57,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:13:57,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:57,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:57,927 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:13:57,928 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:13:58,056 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:58,110 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:58,110 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:13:58,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:58,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:13:58,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:58,181 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:13:58,181 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 65 treesize of output 45 [2025-04-13 22:13:58,207 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:58,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:58,294 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:13:58,294 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 71 treesize of output 88 [2025-04-13 22:13:58,363 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:58,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394524750] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:58,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:58,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2025-04-13 22:13:58,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852097931] [2025-04-13 22:13:58,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:58,364 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:13:58,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:58,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:13:58,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:13:58,364 INFO L87 Difference]: Start difference. First operand 106 states and 252 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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:58,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:13:58,729 INFO L93 Difference]: Finished difference Result 138 states and 306 transitions. [2025-04-13 22:13:58,730 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:13:58,730 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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:58,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:13:58,730 INFO L225 Difference]: With dead ends: 138 [2025-04-13 22:13:58,730 INFO L226 Difference]: Without dead ends: 127 [2025-04-13 22:13:58,731 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=730, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:13:58,731 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:13:58,731 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:13:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-04-13 22:13:58,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 106. [2025-04-13 22:13:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.380952380952381) internal successors, (250), 105 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call 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:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 250 transitions. [2025-04-13 22:13:58,765 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 250 transitions. Word has length 27 [2025-04-13 22:13:58,765 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:13:58,765 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 250 transitions. [2025-04-13 22:13:58,765 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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:58,766 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 250 transitions. [2025-04-13 22:13:58,766 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:13:58,766 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:13:58,766 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:58,774 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:13:58,966 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,SelfDestructingSolverStorable49 [2025-04-13 22:13:58,966 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:58,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:13:58,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1805324547, now seen corresponding path program 42 times [2025-04-13 22:13:58,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:13:58,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909435967] [2025-04-13 22:13:58,967 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:58,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:13:58,974 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:58,983 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:58,983 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:58,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:59,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:13:59,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909435967] [2025-04-13 22:13:59,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909435967] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:13:59,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651303335] [2025-04-13 22:13:59,304 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:13:59,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:13:59,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:13:59,306 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:13:59,307 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:13:59,438 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:13:59,461 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:59,461 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:13:59,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:13:59,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:13:59,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:13:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:59,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:13:59,709 INFO L325 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2025-04-13 22:13:59,709 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 63 treesize of output 67 [2025-04-13 22:13:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:13:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651303335] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:13:59,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:13:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 22:13:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803096826] [2025-04-13 22:13:59,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:13:59,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:13:59,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:13:59,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:13:59,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:13:59,750 INFO L87 Difference]: Start difference. First operand 106 states and 250 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:14:00,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:00,174 INFO L93 Difference]: Finished difference Result 137 states and 299 transitions. [2025-04-13 22:14:00,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:14:00,174 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:14:00,174 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:00,175 INFO L225 Difference]: With dead ends: 137 [2025-04-13 22:14:00,175 INFO L226 Difference]: Without dead ends: 123 [2025-04-13 22:14:00,175 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:14:00,175 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:00,176 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-04-13 22:14:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2025-04-13 22:14:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 2.361904761904762) internal successors, (248), 105 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call 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:00,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 248 transitions. [2025-04-13 22:14:00,210 INFO L79 Accepts]: Start accepts. Automaton has 106 states and 248 transitions. Word has length 27 [2025-04-13 22:14:00,210 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:00,210 INFO L485 AbstractCegarLoop]: Abstraction has 106 states and 248 transitions. [2025-04-13 22:14:00,210 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 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:14:00,211 INFO L278 IsEmpty]: Start isEmpty. Operand 106 states and 248 transitions. [2025-04-13 22:14:00,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:14:00,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:00,211 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:14:00,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-04-13 22:14:00,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:00,411 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:00,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:00,412 INFO L85 PathProgramCache]: Analyzing trace with hash 71276790, now seen corresponding path program 43 times [2025-04-13 22:14:00,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:00,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334622849] [2025-04-13 22:14:00,412 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:00,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:00,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:14:00,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:14:00,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:00,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:00,754 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,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:00,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334622849] [2025-04-13 22:14:00,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334622849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:00,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482013034] [2025-04-13 22:14:00,754 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:00,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:00,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:00,756 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:00,756 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:00,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 22:14:00,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:14:00,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:00,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:00,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 22:14:00,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:00,962 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:00,963 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 46 treesize of output 34 [2025-04-13 22:14:00,990 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,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:01,071 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:14:01,071 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 44 treesize of output 77 [2025-04-13 22:14:01,097 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:14:01,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482013034] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:01,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:01,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-04-13 22:14:01,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401151878] [2025-04-13 22:14:01,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:01,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:14:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:01,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:14:01,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:14:01,099 INFO L87 Difference]: Start difference. First operand 106 states and 248 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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:14:01,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:01,374 INFO L93 Difference]: Finished difference Result 140 states and 307 transitions. [2025-04-13 22:14:01,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:14:01,374 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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 27 [2025-04-13 22:14:01,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:01,375 INFO L225 Difference]: With dead ends: 140 [2025-04-13 22:14:01,375 INFO L226 Difference]: Without dead ends: 133 [2025-04-13 22:14:01,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:14:01,375 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:01,375 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-04-13 22:14:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 98. [2025-04-13 22:14:01,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.268041237113402) internal successors, (220), 97 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call 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:01,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 220 transitions. [2025-04-13 22:14:01,406 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 220 transitions. Word has length 27 [2025-04-13 22:14:01,406 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:01,406 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 220 transitions. [2025-04-13 22:14:01,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 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:14:01,406 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 220 transitions. [2025-04-13 22:14:01,406 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:14:01,406 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:01,407 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:14:01,415 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:01,607 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,SelfDestructingSolverStorable51 [2025-04-13 22:14:01,607 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:01,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:01,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1603151962, now seen corresponding path program 44 times [2025-04-13 22:14:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:01,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273637869] [2025-04-13 22:14:01,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:01,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:01,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:14:01,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:14:01,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:01,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:01,893 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:14:01,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:01,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273637869] [2025-04-13 22:14:01,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273637869] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:01,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23052519] [2025-04-13 22:14:01,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:01,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:01,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:01,895 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:01,895 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:02,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:14:02,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:14:02,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:02,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:02,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:14:02,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:02,153 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:14:02,153 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 25 treesize of output 9 [2025-04-13 22:14:02,162 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:14:02,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:02,245 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:14:02,245 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 32 treesize of output 48 [2025-04-13 22:14:02,259 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:14:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23052519] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:02,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 22:14:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902063989] [2025-04-13 22:14:02,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:02,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 22:14:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:02,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 22:14:02,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-04-13 22:14:02,260 INFO L87 Difference]: Start difference. First operand 98 states and 220 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 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:14:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:02,577 INFO L93 Difference]: Finished difference Result 142 states and 307 transitions. [2025-04-13 22:14:02,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:14:02,577 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 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 27 [2025-04-13 22:14:02,577 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:02,578 INFO L225 Difference]: With dead ends: 142 [2025-04-13 22:14:02,578 INFO L226 Difference]: Without dead ends: 135 [2025-04-13 22:14:02,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:14:02,578 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:02,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:02,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-04-13 22:14:02,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 98. [2025-04-13 22:14:02,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.288659793814433) internal successors, (222), 97 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call 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:02,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 222 transitions. [2025-04-13 22:14:02,612 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 222 transitions. Word has length 27 [2025-04-13 22:14:02,612 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:02,612 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 222 transitions. [2025-04-13 22:14:02,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 19 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:14:02,612 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 222 transitions. [2025-04-13 22:14:02,612 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:14:02,612 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:02,612 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:14:02,621 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:02,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:02,813 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:02,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:02,813 INFO L85 PathProgramCache]: Analyzing trace with hash 905810899, now seen corresponding path program 45 times [2025-04-13 22:14:02,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:02,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501331936] [2025-04-13 22:14:02,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:02,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:02,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:14:02,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 22:14:02,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:02,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:03,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501331936] [2025-04-13 22:14:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501331936] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:03,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557461418] [2025-04-13 22:14:03,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:03,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:03,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:03,071 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:03,072 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:03,210 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:14:03,228 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 22:14:03,228 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:03,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:03,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:14:03,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:03,357 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:03,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:03,436 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:14:03,436 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 71 treesize of output 88 [2025-04-13 22:14:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557461418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:03,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 22:14:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032529741] [2025-04-13 22:14:03,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:03,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 22:14:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:03,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 22:14:03,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-04-13 22:14:03,505 INFO L87 Difference]: Start difference. First operand 98 states and 222 transitions. Second operand has 20 states, 20 states have (on average 2.05) 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:14:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:03,738 INFO L93 Difference]: Finished difference Result 121 states and 264 transitions. [2025-04-13 22:14:03,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:14:03,738 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.05) 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 27 [2025-04-13 22:14:03,738 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:03,739 INFO L225 Difference]: With dead ends: 121 [2025-04-13 22:14:03,739 INFO L226 Difference]: Without dead ends: 107 [2025-04-13 22:14:03,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:03,739 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:03,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:03,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-04-13 22:14:03,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 98. [2025-04-13 22:14:03,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.268041237113402) internal successors, (220), 97 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call 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,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 220 transitions. [2025-04-13 22:14:03,772 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 220 transitions. Word has length 27 [2025-04-13 22:14:03,772 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:03,772 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 220 transitions. [2025-04-13 22:14:03,772 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.05) 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:14:03,772 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 220 transitions. [2025-04-13 22:14:03,773 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:14:03,773 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:03,773 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:14:03,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2025-04-13 22:14:03,973 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:03,973 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:03,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:03,973 INFO L85 PathProgramCache]: Analyzing trace with hash 94711239, now seen corresponding path program 46 times [2025-04-13 22:14:03,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:03,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684089779] [2025-04-13 22:14:03,973 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:03,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:03,981 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:14:03,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:14:03,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:03,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:04,276 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:04,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:04,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684089779] [2025-04-13 22:14:04,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684089779] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:04,276 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181440157] [2025-04-13 22:14:04,276 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:04,278 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:04,279 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:04,422 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 22:14:04,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:14:04,444 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:04,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:04,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 22:14:04,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:04,536 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:14:04,536 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 46 treesize of output 31 [2025-04-13 22:14:04,545 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:14:04,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:04,686 INFO L325 Elim1Store]: treesize reduction 24, result has 65.2 percent of original size [2025-04-13 22:14:04,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 63 treesize of output 67 [2025-04-13 22:14:04,716 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:14:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181440157] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:04,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2025-04-13 22:14:04,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165886955] [2025-04-13 22:14:04,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:04,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:14:04,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:04,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:14:04,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:14:04,717 INFO L87 Difference]: Start difference. First operand 98 states and 220 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:14:05,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:05,022 INFO L93 Difference]: Finished difference Result 112 states and 242 transitions. [2025-04-13 22:14:05,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:14:05,023 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:14:05,023 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:05,023 INFO L225 Difference]: With dead ends: 112 [2025-04-13 22:14:05,023 INFO L226 Difference]: Without dead ends: 93 [2025-04-13 22:14:05,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:05,024 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:05,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:05,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-13 22:14:05,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-04-13 22:14:05,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.2717391304347827) internal successors, (209), 92 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call 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:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 209 transitions. [2025-04-13 22:14:05,066 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 209 transitions. Word has length 27 [2025-04-13 22:14:05,066 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:05,066 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 209 transitions. [2025-04-13 22:14:05,066 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:14:05,066 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 209 transitions. [2025-04-13 22:14:05,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:14:05,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:05,067 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:14:05,074 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:05,267 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,SelfDestructingSolverStorable54 [2025-04-13 22:14:05,267 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:05,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:05,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1792301686, now seen corresponding path program 47 times [2025-04-13 22:14:05,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:05,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408844624] [2025-04-13 22:14:05,268 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:05,276 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:14:05,287 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:14:05,287 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:05,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:14:05,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:05,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408844624] [2025-04-13 22:14:05,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408844624] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:05,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993990014] [2025-04-13 22:14:05,557 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:05,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:05,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:05,559 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:05,560 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:05,701 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:14:05,757 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 22:14:05,758 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:05,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:05,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:14:05,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:05,848 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,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:05,932 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:14:05,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 44 treesize of output 77 [2025-04-13 22:14:05,961 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:14:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993990014] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:05,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 21 [2025-04-13 22:14:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232427523] [2025-04-13 22:14:05,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:05,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 22:14:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:05,961 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 22:14:05,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:14:05,962 INFO L87 Difference]: Start difference. First operand 93 states and 209 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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:14:06,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:06,235 INFO L93 Difference]: Finished difference Result 116 states and 255 transitions. [2025-04-13 22:14:06,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:14:06,236 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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:14:06,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:06,236 INFO L225 Difference]: With dead ends: 116 [2025-04-13 22:14:06,236 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 22:14:06,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:14:06,237 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:06,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:06,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 22:14:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2025-04-13 22:14:06,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 2.2325581395348837) internal successors, (192), 86 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call 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,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 192 transitions. [2025-04-13 22:14:06,271 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 192 transitions. Word has length 27 [2025-04-13 22:14:06,271 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:06,271 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 192 transitions. [2025-04-13 22:14:06,271 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 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:14:06,271 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 192 transitions. [2025-04-13 22:14:06,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 22:14:06,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:06,272 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:14:06,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-13 22:14:06,472 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,SelfDestructingSolverStorable55 [2025-04-13 22:14:06,472 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:06,472 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:06,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1836508680, now seen corresponding path program 48 times [2025-04-13 22:14:06,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:06,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101316555] [2025-04-13 22:14:06,473 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:06,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:06,480 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:14:06,490 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 27 statements. [2025-04-13 22:14:06,490 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:14:06,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:06,744 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:14:06,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:06,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101316555] [2025-04-13 22:14:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101316555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:06,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851435199] [2025-04-13 22:14:06,745 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:06,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:06,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:06,747 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:06,748 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:06,898 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 22:14:06,921 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 27 statements. [2025-04-13 22:14:06,921 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:14:06,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:06,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:14:06,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:07,024 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:14:07,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:07,098 INFO L325 Elim1Store]: treesize reduction 28, result has 59.4 percent of original size [2025-04-13 22:14:07,099 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 32 treesize of output 48 [2025-04-13 22:14:07,112 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:14:07,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851435199] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:07,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:07,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 18 [2025-04-13 22:14:07,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498670831] [2025-04-13 22:14:07,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:07,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 22:14:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 22:14:07,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-04-13 22:14:07,113 INFO L87 Difference]: Start difference. First operand 87 states and 192 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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:14:07,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:07,334 INFO L93 Difference]: Finished difference Result 108 states and 233 transitions. [2025-04-13 22:14:07,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:14:07,335 INFO L79 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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 27 [2025-04-13 22:14:07,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:07,335 INFO L225 Difference]: With dead ends: 108 [2025-04-13 22:14:07,335 INFO L226 Difference]: Without dead ends: 101 [2025-04-13 22:14:07,335 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2025-04-13 22:14:07,336 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:07,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:14:07,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-13 22:14:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 81. [2025-04-13 22:14:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.1625) internal successors, (173), 80 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call 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,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 173 transitions. [2025-04-13 22:14:07,364 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 173 transitions. Word has length 27 [2025-04-13 22:14:07,364 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:07,364 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 173 transitions. [2025-04-13 22:14:07,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 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:14:07,364 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 173 transitions. [2025-04-13 22:14:07,364 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:07,364 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:07,364 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,371 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:07,565 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,SelfDestructingSolverStorable56 [2025-04-13 22:14:07,565 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:07,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:07,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1398267816, now seen corresponding path program 49 times [2025-04-13 22:14:07,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:07,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617171275] [2025-04-13 22:14:07,565 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:07,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:07,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:07,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:07,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:07,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:14:08,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:08,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617171275] [2025-04-13 22:14:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617171275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:08,056 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286188200] [2025-04-13 22:14:08,056 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:08,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:08,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:08,057 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:08,058 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:08,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:08,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:08,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:08,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:08,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:08,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:08,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:08,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 35 treesize of output 23 [2025-04-13 22:14:08,341 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:08,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:08,627 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:14:08,627 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 138 treesize of output 83 [2025-04-13 22:14:08,653 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:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286188200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:08,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 22:14:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138016803] [2025-04-13 22:14:08,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:08,654 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:14:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:08,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:14:08,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:14:08,654 INFO L87 Difference]: Start difference. First operand 81 states and 173 transitions. Second operand has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:09,348 INFO L93 Difference]: Finished difference Result 125 states and 275 transitions. [2025-04-13 22:14:09,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:14:09,348 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:09,349 INFO L225 Difference]: With dead ends: 125 [2025-04-13 22:14:09,349 INFO L226 Difference]: Without dead ends: 120 [2025-04-13 22:14:09,349 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=326, Invalid=1744, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:14:09,350 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:09,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-04-13 22:14:09,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 93. [2025-04-13 22:14:09,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.2717391304347827) internal successors, (209), 92 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call 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,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 209 transitions. [2025-04-13 22:14:09,384 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 209 transitions. Word has length 28 [2025-04-13 22:14:09,384 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:09,384 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 209 transitions. [2025-04-13 22:14:09,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,384 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 209 transitions. [2025-04-13 22:14:09,385 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:09,385 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:09,385 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,392 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:09,585 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 22:14:09,585 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:09,585 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:09,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1246747376, now seen corresponding path program 50 times [2025-04-13 22:14:09,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:09,586 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994667263] [2025-04-13 22:14:09,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:09,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:09,593 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:09,606 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:09,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:09,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:09,999 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:14:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:10,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994667263] [2025-04-13 22:14:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994667263] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:10,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783451472] [2025-04-13 22:14:10,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:10,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:10,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:10,002 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:10,011 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:10,160 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:10,184 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:10,185 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:10,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:10,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:14:10,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:10,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:10,255 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 27 treesize of output 19 [2025-04-13 22:14:10,276 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:14:10,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:10,524 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:10,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 181 treesize of output 113 [2025-04-13 22:14:10,604 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:10,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783451472] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:10,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:10,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 25 [2025-04-13 22:14:10,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851747121] [2025-04-13 22:14:10,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:10,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:14:10,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:10,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:14:10,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:10,605 INFO L87 Difference]: Start difference. First operand 93 states and 209 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:14:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:11,239 INFO L93 Difference]: Finished difference Result 152 states and 345 transitions. [2025-04-13 22:14:11,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:14:11,239 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 28 [2025-04-13 22:14:11,240 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:11,240 INFO L225 Difference]: With dead ends: 152 [2025-04-13 22:14:11,240 INFO L226 Difference]: Without dead ends: 143 [2025-04-13 22:14:11,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=1336, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:14:11,241 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:11,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-13 22:14:11,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 109. [2025-04-13 22:14:11,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.3425925925925926) internal successors, (253), 108 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call 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:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 253 transitions. [2025-04-13 22:14:11,287 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 253 transitions. Word has length 28 [2025-04-13 22:14:11,287 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:11,287 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 253 transitions. [2025-04-13 22:14:11,287 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:14:11,287 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 253 transitions. [2025-04-13 22:14:11,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:11,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:11,288 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:11,294 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:11,488 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,SelfDestructingSolverStorable58 [2025-04-13 22:14:11,488 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:11,488 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:11,489 INFO L85 PathProgramCache]: Analyzing trace with hash -183283304, now seen corresponding path program 51 times [2025-04-13 22:14:11,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:11,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477644174] [2025-04-13 22:14:11,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:11,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:11,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:11,504 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:11,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:11,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:11,781 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,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:11,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477644174] [2025-04-13 22:14:11,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477644174] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:11,782 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064397457] [2025-04-13 22:14:11,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:11,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:11,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:11,783 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:11,784 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:11,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:11,955 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:11,955 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:11,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:11,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:14:11,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:12,022 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:12,022 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 27 treesize of output 19 [2025-04-13 22:14:12,040 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:12,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:12,294 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:12,294 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 181 treesize of output 113 [2025-04-13 22:14:12,362 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:12,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064397457] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:12,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:12,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 22:14:12,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355601509] [2025-04-13 22:14:12,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:12,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:14:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:12,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:14:12,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:14:12,363 INFO L87 Difference]: Start difference. First operand 109 states and 253 transitions. Second operand has 24 states, 23 states have (on average 2.0) internal successors, (46), 24 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:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:12,774 INFO L93 Difference]: Finished difference Result 134 states and 309 transitions. [2025-04-13 22:14:12,774 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:14:12,774 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 24 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:12,774 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:12,775 INFO L225 Difference]: With dead ends: 134 [2025-04-13 22:14:12,775 INFO L226 Difference]: Without dead ends: 129 [2025-04-13 22:14:12,775 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=135, Invalid=735, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:14:12,775 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:12,775 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:14:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-04-13 22:14:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2025-04-13 22:14:12,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.3454545454545452) internal successors, (258), 110 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call 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,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 258 transitions. [2025-04-13 22:14:12,827 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 258 transitions. Word has length 28 [2025-04-13 22:14:12,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:12,827 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 258 transitions. [2025-04-13 22:14:12,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0) internal successors, (46), 24 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:12,827 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 258 transitions. [2025-04-13 22:14:12,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:12,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:12,828 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,834 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:13,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 22:14:13,028 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:13,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:13,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2053887704, now seen corresponding path program 52 times [2025-04-13 22:14:13,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:13,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388645130] [2025-04-13 22:14:13,029 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:13,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:13,036 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:13,044 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:13,044 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:13,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:13,531 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:14:13,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:13,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388645130] [2025-04-13 22:14:13,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388645130] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:13,531 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128862978] [2025-04-13 22:14:13,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:13,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:13,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:13,533 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:14:13,534 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:14:13,691 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:13,717 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:13,717 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:13,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:13,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:13,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:13,807 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:13,808 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 35 treesize of output 23 [2025-04-13 22:14:13,813 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:13,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:14,088 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:14,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 181 treesize of output 113 [2025-04-13 22:14:14,154 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:14,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128862978] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:14,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:14,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:14:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709499670] [2025-04-13 22:14:14,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:14,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:14:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:14,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:14:14,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:14,155 INFO L87 Difference]: Start difference. First operand 111 states and 258 transitions. Second operand has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 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:14:14,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:14,899 INFO L93 Difference]: Finished difference Result 164 states and 371 transitions. [2025-04-13 22:14:14,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:14:14,899 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 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:14:14,899 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:14,900 INFO L225 Difference]: With dead ends: 164 [2025-04-13 22:14:14,900 INFO L226 Difference]: Without dead ends: 155 [2025-04-13 22:14:14,901 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=316, Invalid=2036, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:14:14,901 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:14,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:14:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-04-13 22:14:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2025-04-13 22:14:14,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.4224137931034484) internal successors, (281), 116 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:14:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 281 transitions. [2025-04-13 22:14:14,957 INFO L79 Accepts]: Start accepts. Automaton has 117 states and 281 transitions. Word has length 28 [2025-04-13 22:14:14,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:14,957 INFO L485 AbstractCegarLoop]: Abstraction has 117 states and 281 transitions. [2025-04-13 22:14:14,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7) internal successors, (51), 31 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:14:14,957 INFO L278 IsEmpty]: Start isEmpty. Operand 117 states and 281 transitions. [2025-04-13 22:14:14,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:14,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:14,957 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:14,963 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:14:15,157 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:15,158 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:15,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:15,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1901032364, now seen corresponding path program 53 times [2025-04-13 22:14:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:15,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439052846] [2025-04-13 22:14:15,158 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:15,166 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:15,181 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:15,182 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:15,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:15,692 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:15,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:15,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439052846] [2025-04-13 22:14:15,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439052846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:15,692 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351831412] [2025-04-13 22:14:15,692 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:15,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:15,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:15,694 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:14:15,694 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:14:15,848 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:15,879 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:15,879 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:15,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:15,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:14:15,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:16,005 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:16,005 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 31 treesize of output 23 [2025-04-13 22:14:16,032 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:16,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:16,296 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:16,296 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 181 treesize of output 113 [2025-04-13 22:14:16,353 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:16,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351831412] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:16,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:16,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2025-04-13 22:14:16,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55524796] [2025-04-13 22:14:16,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:16,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:14:16,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:16,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:14:16,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:14:16,355 INFO L87 Difference]: Start difference. First operand 117 states and 281 transitions. Second operand has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 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:14:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:16,931 INFO L93 Difference]: Finished difference Result 142 states and 331 transitions. [2025-04-13 22:14:16,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:14:16,932 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 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:14:16,932 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:16,932 INFO L225 Difference]: With dead ends: 142 [2025-04-13 22:14:16,932 INFO L226 Difference]: Without dead ends: 137 [2025-04-13 22:14:16,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:14:16,933 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:16,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-04-13 22:14:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2025-04-13 22:14:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.4035087719298245) internal successors, (274), 114 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call 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:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 274 transitions. [2025-04-13 22:14:16,983 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 274 transitions. Word has length 28 [2025-04-13 22:14:16,983 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:16,983 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 274 transitions. [2025-04-13 22:14:16,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 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:14:16,984 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 274 transitions. [2025-04-13 22:14:16,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:16,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:16,984 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:16,991 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:14:17,184 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:17,184 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:17,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2109298964, now seen corresponding path program 54 times [2025-04-13 22:14:17,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:17,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464452533] [2025-04-13 22:14:17,185 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:17,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:17,193 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:17,205 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:14:17,205 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:14:17,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:17,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:17,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:17,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464452533] [2025-04-13 22:14:17,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464452533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:17,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675657007] [2025-04-13 22:14:17,508 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:17,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:17,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:17,509 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:14:17,510 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:14:17,685 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:17,712 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:14:17,712 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:14:17,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:17,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:14:17,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:17,776 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:17,777 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 27 treesize of output 19 [2025-04-13 22:14:17,808 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:17,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:18,061 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:18,062 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 181 treesize of output 113 [2025-04-13 22:14:18,131 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:18,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675657007] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:18,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 22:14:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247922080] [2025-04-13 22:14:18,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:18,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:14:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:18,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:14:18,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:14:18,132 INFO L87 Difference]: Start difference. First operand 115 states and 274 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:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:18,726 INFO L93 Difference]: Finished difference Result 162 states and 370 transitions. [2025-04-13 22:14:18,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:14:18,726 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:18,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:18,727 INFO L225 Difference]: With dead ends: 162 [2025-04-13 22:14:18,727 INFO L226 Difference]: Without dead ends: 153 [2025-04-13 22:14:18,727 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:14:18,727 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:18,727 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:14:18,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-04-13 22:14:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 115. [2025-04-13 22:14:18,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 2.4035087719298245) internal successors, (274), 114 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call 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,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 274 transitions. [2025-04-13 22:14:18,779 INFO L79 Accepts]: Start accepts. Automaton has 115 states and 274 transitions. Word has length 28 [2025-04-13 22:14:18,779 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:18,779 INFO L485 AbstractCegarLoop]: Abstraction has 115 states and 274 transitions. [2025-04-13 22:14:18,779 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:18,779 INFO L278 IsEmpty]: Start isEmpty. Operand 115 states and 274 transitions. [2025-04-13 22:14:18,779 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:18,779 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:18,779 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,786 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:14:18,980 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:18,980 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:18,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1956443624, now seen corresponding path program 55 times [2025-04-13 22:14:18,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:18,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784740066] [2025-04-13 22:14:18,980 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:18,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:18,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:18,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:18,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:18,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:19,448 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,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:19,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784740066] [2025-04-13 22:14:19,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784740066] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:19,449 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868689266] [2025-04-13 22:14:19,449 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:19,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:19,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:19,450 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:14:19,451 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:14:19,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:19,629 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,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:19,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:19,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:19,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:19,694 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:19,694 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 35 treesize of output 23 [2025-04-13 22:14:19,736 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:19,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:20,000 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:20,000 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 181 treesize of output 113 [2025-04-13 22:14:20,064 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,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868689266] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:20,065 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:20,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 22:14:20,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51187447] [2025-04-13 22:14:20,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:20,065 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:14:20,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:20,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:14:20,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:14:20,065 INFO L87 Difference]: Start difference. First operand 115 states and 274 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:14:20,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:20,706 INFO L93 Difference]: Finished difference Result 136 states and 314 transitions. [2025-04-13 22:14:20,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:14:20,706 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 28 [2025-04-13 22:14:20,707 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:20,707 INFO L225 Difference]: With dead ends: 136 [2025-04-13 22:14:20,707 INFO L226 Difference]: Without dead ends: 131 [2025-04-13 22:14:20,707 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=286, Invalid=1606, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:14:20,708 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:20,708 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:20,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-04-13 22:14:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 111. [2025-04-13 22:14:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.3636363636363638) internal successors, (260), 110 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call 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:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 260 transitions. [2025-04-13 22:14:20,757 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 260 transitions. Word has length 28 [2025-04-13 22:14:20,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:20,757 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 260 transitions. [2025-04-13 22:14:20,757 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:14:20,757 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 260 transitions. [2025-04-13 22:14:20,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:20,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:20,757 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:20,764 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:14:20,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:20,958 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:14:20,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1242510802, now seen corresponding path program 56 times [2025-04-13 22:14:20,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:20,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351752201] [2025-04-13 22:14:20,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:20,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:20,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:20,979 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:20,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:20,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:21,401 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:21,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:21,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351752201] [2025-04-13 22:14:21,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351752201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:21,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268851883] [2025-04-13 22:14:21,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:21,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:21,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:21,403 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:14:21,403 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:14:21,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:21,599 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:21,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:21,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:21,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:14:21,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:21,687 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:21,687 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 27 treesize of output 19 [2025-04-13 22:14:21,723 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:14:21,723 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:21,921 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:21,922 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 173 treesize of output 107 [2025-04-13 22:14:22,008 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:22,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268851883] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:22,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:22,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:14:22,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796527984] [2025-04-13 22:14:22,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:22,009 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:14:22,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:22,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:14:22,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:14:22,009 INFO L87 Difference]: Start difference. First operand 111 states and 260 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 28 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:14:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:22,644 INFO L93 Difference]: Finished difference Result 166 states and 383 transitions. [2025-04-13 22:14:22,644 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:14:22,644 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 28 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:14:22,644 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:22,645 INFO L225 Difference]: With dead ends: 166 [2025-04-13 22:14:22,645 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 22:14:22,645 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=227, Invalid=1333, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:14:22,646 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:22,646 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 22:14:22,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 120. [2025-04-13 22:14:22,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.46218487394958) internal successors, (293), 119 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call 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,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 293 transitions. [2025-04-13 22:14:22,702 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 293 transitions. Word has length 28 [2025-04-13 22:14:22,703 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:22,703 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 293 transitions. [2025-04-13 22:14:22,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 28 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:14:22,703 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 293 transitions. [2025-04-13 22:14:22,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:22,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:22,703 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:22,710 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:14:22,903 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,SelfDestructingSolverStorable64 [2025-04-13 22:14:22,904 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:14:22,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -171985030, now seen corresponding path program 57 times [2025-04-13 22:14:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:22,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089726230] [2025-04-13 22:14:22,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:22,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:22,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:22,921 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:22,921 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:22,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:23,206 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,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:23,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089726230] [2025-04-13 22:14:23,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089726230] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:23,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734668900] [2025-04-13 22:14:23,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:23,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:23,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:23,208 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:14:23,209 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:14:23,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:23,392 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:23,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:14:23,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:23,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:14:23,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:23,475 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:23,475 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 27 treesize of output 19 [2025-04-13 22:14:23,494 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,494 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:23,689 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:23,689 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 173 treesize of output 107 [2025-04-13 22:14:23,758 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,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734668900] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:23,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:23,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:14:23,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478484064] [2025-04-13 22:14:23,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:23,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:14:23,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:23,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:14:23,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:23,759 INFO L87 Difference]: Start difference. First operand 120 states and 293 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:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:24,382 INFO L93 Difference]: Finished difference Result 192 states and 453 transitions. [2025-04-13 22:14:24,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:14:24,382 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:24,383 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:24,383 INFO L225 Difference]: With dead ends: 192 [2025-04-13 22:14:24,383 INFO L226 Difference]: Without dead ends: 179 [2025-04-13 22:14:24,384 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:14:24,384 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:24,384 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-04-13 22:14:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 132. [2025-04-13 22:14:24,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 2.6030534351145036) internal successors, (341), 131 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call 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:24,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 341 transitions. [2025-04-13 22:14:24,448 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 341 transitions. Word has length 28 [2025-04-13 22:14:24,448 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:24,448 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 341 transitions. [2025-04-13 22:14:24,448 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:24,449 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 341 transitions. [2025-04-13 22:14:24,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:24,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:24,449 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:24,456 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:14:24,649 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,SelfDestructingSolverStorable65 [2025-04-13 22:14:24,649 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:14:24,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:24,650 INFO L85 PathProgramCache]: Analyzing trace with hash 761105960, now seen corresponding path program 58 times [2025-04-13 22:14:24,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:24,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742894774] [2025-04-13 22:14:24,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:24,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:24,657 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:24,672 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:24,672 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:24,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:25,178 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:25,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:25,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742894774] [2025-04-13 22:14:25,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742894774] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:25,178 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978692302] [2025-04-13 22:14:25,179 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:25,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:25,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:25,180 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:14:25,181 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:14:25,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:25,369 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:25,369 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:25,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:25,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:25,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:25,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:25,451 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 35 treesize of output 23 [2025-04-13 22:14:25,478 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:25,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:25,700 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:25,700 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 173 treesize of output 107 [2025-04-13 22:14:25,782 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:25,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978692302] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:25,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:25,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 32 [2025-04-13 22:14:25,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079419725] [2025-04-13 22:14:25,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:25,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:14:25,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:25,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:14:25,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:14:25,783 INFO L87 Difference]: Start difference. First operand 132 states and 341 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:14:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:26,726 INFO L93 Difference]: Finished difference Result 194 states and 480 transitions. [2025-04-13 22:14:26,726 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:14:26,726 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 28 [2025-04-13 22:14:26,726 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:26,727 INFO L225 Difference]: With dead ends: 194 [2025-04-13 22:14:26,727 INFO L226 Difference]: Without dead ends: 185 [2025-04-13 22:14:26,727 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=317, Invalid=2233, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:14:26,728 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:26,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:14:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-04-13 22:14:26,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 142. [2025-04-13 22:14:26,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.652482269503546) internal successors, (374), 141 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call 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:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 374 transitions. [2025-04-13 22:14:26,799 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 374 transitions. Word has length 28 [2025-04-13 22:14:26,799 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:26,799 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 374 transitions. [2025-04-13 22:14:26,799 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:14:26,799 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 374 transitions. [2025-04-13 22:14:26,799 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:26,799 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:26,799 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:26,806 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:14:26,999 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:26,999 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:14:27,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1490947416, now seen corresponding path program 59 times [2025-04-13 22:14:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:27,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241650668] [2025-04-13 22:14:27,000 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:27,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:27,011 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:27,023 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:27,023 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:27,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:27,392 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:27,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:27,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241650668] [2025-04-13 22:14:27,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241650668] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:27,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488285187] [2025-04-13 22:14:27,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:27,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:27,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:27,394 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:14:27,395 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:14:27,565 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:27,627 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:27,628 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:27,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:27,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:14:27,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:27,725 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:27,725 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 31 treesize of output 23 [2025-04-13 22:14:27,765 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:27,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:27,976 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:27,976 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 173 treesize of output 107 [2025-04-13 22:14:28,039 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:28,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488285187] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:28,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:28,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 27 [2025-04-13 22:14:28,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398704119] [2025-04-13 22:14:28,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:28,040 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:14:28,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:28,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:14:28,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:14:28,040 INFO L87 Difference]: Start difference. First operand 142 states and 374 transitions. Second operand has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 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:14:28,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:28,747 INFO L93 Difference]: Finished difference Result 206 states and 507 transitions. [2025-04-13 22:14:28,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:14:28,747 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 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:14:28,747 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:28,748 INFO L225 Difference]: With dead ends: 206 [2025-04-13 22:14:28,748 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 22:14:28,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=1632, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:14:28,749 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:28,749 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:28,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 22:14:28,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 142. [2025-04-13 22:14:28,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.652482269503546) internal successors, (374), 141 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call 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:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 374 transitions. [2025-04-13 22:14:28,827 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 374 transitions. Word has length 28 [2025-04-13 22:14:28,827 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:28,827 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 374 transitions. [2025-04-13 22:14:28,827 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 28 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:14:28,827 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 374 transitions. [2025-04-13 22:14:28,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:28,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:28,828 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:28,835 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:14:29,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:29,028 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:14:29,028 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:29,028 INFO L85 PathProgramCache]: Analyzing trace with hash 705694700, now seen corresponding path program 60 times [2025-04-13 22:14:29,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:29,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492929584] [2025-04-13 22:14:29,029 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:29,036 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:29,051 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:29,051 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:29,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:29,361 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:29,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:29,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492929584] [2025-04-13 22:14:29,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492929584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:29,362 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583286605] [2025-04-13 22:14:29,362 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:29,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:29,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:29,364 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:14:29,365 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:14:29,537 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:29,564 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:29,564 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:29,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:29,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:14:29,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:29,635 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:29,635 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 27 treesize of output 19 [2025-04-13 22:14:29,667 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:29,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:29,866 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:29,866 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 173 treesize of output 107 [2025-04-13 22:14:29,943 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:29,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583286605] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:29,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:29,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:14:29,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601156099] [2025-04-13 22:14:29,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:29,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:14:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:29,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:14:29,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:29,944 INFO L87 Difference]: Start difference. First operand 142 states and 374 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:30,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:30,517 INFO L93 Difference]: Finished difference Result 198 states and 486 transitions. [2025-04-13 22:14:30,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:14:30,517 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:30,517 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:30,518 INFO L225 Difference]: With dead ends: 198 [2025-04-13 22:14:30,518 INFO L226 Difference]: Without dead ends: 189 [2025-04-13 22:14:30,519 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:14:30,519 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:30,519 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:14:30,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-04-13 22:14:30,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 140. [2025-04-13 22:14:30,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.6402877697841727) internal successors, (367), 139 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call 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:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 367 transitions. [2025-04-13 22:14:30,597 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 367 transitions. Word has length 28 [2025-04-13 22:14:30,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:30,597 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 367 transitions. [2025-04-13 22:14:30,597 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:30,597 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 367 transitions. [2025-04-13 22:14:30,597 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:30,597 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:30,597 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:30,604 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:14:30,798 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 22:14:30,798 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:14:30,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1411289468, now seen corresponding path program 61 times [2025-04-13 22:14:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:30,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797374819] [2025-04-13 22:14:30,798 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:30,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:30,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:30,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:30,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:30,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:31,264 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:14:31,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:31,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797374819] [2025-04-13 22:14:31,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797374819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:31,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428194300] [2025-04-13 22:14:31,264 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:31,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:31,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:31,266 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:14:31,267 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:14:31,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:31,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:31,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:31,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:31,543 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:31,543 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 35 treesize of output 23 [2025-04-13 22:14:31,568 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:31,568 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:31,832 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:31,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 181 treesize of output 113 [2025-04-13 22:14:31,896 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:31,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428194300] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:31,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:31,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 32 [2025-04-13 22:14:31,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080809213] [2025-04-13 22:14:31,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:31,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:14:31,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:31,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:14:31,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:14:31,897 INFO L87 Difference]: Start difference. First operand 140 states and 367 transitions. Second operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:32,856 INFO L93 Difference]: Finished difference Result 203 states and 512 transitions. [2025-04-13 22:14:32,856 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:14:32,856 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:32,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:32,857 INFO L225 Difference]: With dead ends: 203 [2025-04-13 22:14:32,857 INFO L226 Difference]: Without dead ends: 194 [2025-04-13 22:14:32,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 604 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=340, Invalid=2416, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:14:32,857 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:32,857 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:32,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-13 22:14:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 148. [2025-04-13 22:14:32,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 2.673469387755102) internal successors, (393), 147 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call 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:32,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 393 transitions. [2025-04-13 22:14:32,937 INFO L79 Accepts]: Start accepts. Automaton has 148 states and 393 transitions. Word has length 28 [2025-04-13 22:14:32,937 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:32,937 INFO L485 AbstractCegarLoop]: Abstraction has 148 states and 393 transitions. [2025-04-13 22:14:32,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:32,937 INFO L278 IsEmpty]: Start isEmpty. Operand 148 states and 393 transitions. [2025-04-13 22:14:32,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:32,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:32,938 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:32,944 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:14:33,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-04-13 22:14:33,138 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:14:33,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:33,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1870928890, now seen corresponding path program 62 times [2025-04-13 22:14:33,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:33,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308158862] [2025-04-13 22:14:33,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:33,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:33,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:33,163 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:33,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:33,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:33,740 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:14:33,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:33,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308158862] [2025-04-13 22:14:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308158862] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:33,740 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683457200] [2025-04-13 22:14:33,740 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:33,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:33,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:33,742 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:14:33,742 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:14:33,917 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:33,941 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:33,942 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:33,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:33,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:14:33,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:34,015 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:34,015 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 27 treesize of output 19 [2025-04-13 22:14:34,052 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:14:34,052 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:34,254 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:34,255 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 173 treesize of output 107 [2025-04-13 22:14:34,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:14:34,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683457200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:34,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:34,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 9] total 32 [2025-04-13 22:14:34,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020416608] [2025-04-13 22:14:34,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:34,337 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:14:34,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:34,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:14:34,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:14:34,337 INFO L87 Difference]: Start difference. First operand 148 states and 393 transitions. Second operand has 33 states, 32 states have (on average 1.78125) internal successors, (57), 33 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:14:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:35,090 INFO L93 Difference]: Finished difference Result 209 states and 522 transitions. [2025-04-13 22:14:35,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:14:35,090 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 33 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:14:35,090 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:35,091 INFO L225 Difference]: With dead ends: 209 [2025-04-13 22:14:35,091 INFO L226 Difference]: Without dead ends: 196 [2025-04-13 22:14:35,091 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=317, Invalid=2035, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:14:35,092 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:35,092 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-13 22:14:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 150. [2025-04-13 22:14:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.697986577181208) internal successors, (402), 149 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call 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:35,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 402 transitions. [2025-04-13 22:14:35,172 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 402 transitions. Word has length 28 [2025-04-13 22:14:35,172 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:35,172 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 402 transitions. [2025-04-13 22:14:35,172 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.78125) internal successors, (57), 33 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:14:35,172 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 402 transitions. [2025-04-13 22:14:35,173 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:35,173 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:35,173 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:35,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2025-04-13 22:14:35,373 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:35,373 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:14:35,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1165928768, now seen corresponding path program 63 times [2025-04-13 22:14:35,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:35,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786709774] [2025-04-13 22:14:35,374 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:35,382 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:35,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 22:14:35,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:14:35,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:35,701 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:35,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:35,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786709774] [2025-04-13 22:14:35,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786709774] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:35,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706669748] [2025-04-13 22:14:35,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:35,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:35,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:35,703 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:14:35,704 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:14:35,880 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:35,904 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 22:14:35,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:14:35,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:35,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:14:35,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:35,981 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:35,981 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 27 treesize of output 19 [2025-04-13 22:14:36,001 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:36,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:36,251 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:36,251 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 181 treesize of output 113 [2025-04-13 22:14:36,321 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:36,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706669748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:36,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:36,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 22:14:36,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77421874] [2025-04-13 22:14:36,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:36,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:14:36,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:36,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:14:36,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:14:36,322 INFO L87 Difference]: Start difference. First operand 150 states and 402 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:36,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:36,969 INFO L93 Difference]: Finished difference Result 211 states and 532 transitions. [2025-04-13 22:14:36,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:14:36,969 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:36,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:36,970 INFO L225 Difference]: With dead ends: 211 [2025-04-13 22:14:36,970 INFO L226 Difference]: Without dead ends: 202 [2025-04-13 22:14:36,970 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:14:36,970 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:36,970 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:14:36,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-04-13 22:14:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 152. [2025-04-13 22:14:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 2.7086092715231787) internal successors, (409), 151 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:14:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 409 transitions. [2025-04-13 22:14:37,053 INFO L79 Accepts]: Start accepts. Automaton has 152 states and 409 transitions. Word has length 28 [2025-04-13 22:14:37,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:37,053 INFO L485 AbstractCegarLoop]: Abstraction has 152 states and 409 transitions. [2025-04-13 22:14:37,053 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:37,053 INFO L278 IsEmpty]: Start isEmpty. Operand 152 states and 409 transitions. [2025-04-13 22:14:37,053 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:37,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:37,054 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,061 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:14:37,254 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,SelfDestructingSolverStorable71 [2025-04-13 22:14:37,254 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:14:37,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:37,254 INFO L85 PathProgramCache]: Analyzing trace with hash -141881556, now seen corresponding path program 64 times [2025-04-13 22:14:37,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:37,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780646139] [2025-04-13 22:14:37,255 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:37,262 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:37,272 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:37,272 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:37,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:37,754 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:37,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:37,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780646139] [2025-04-13 22:14:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780646139] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:37,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899749992] [2025-04-13 22:14:37,754 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:37,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:37,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:37,756 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:14:37,757 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:14:37,934 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:37,957 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:37,957 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:37,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:37,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:37,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:38,030 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:38,030 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 35 treesize of output 23 [2025-04-13 22:14:38,071 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:38,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:38,311 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:38,312 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 181 treesize of output 113 [2025-04-13 22:14:38,389 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:38,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899749992] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:38,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:38,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 22:14:38,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998908884] [2025-04-13 22:14:38,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:38,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:14:38,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:38,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:14:38,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:14:38,390 INFO L87 Difference]: Start difference. First operand 152 states and 409 transitions. Second operand has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 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:14:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:39,261 INFO L93 Difference]: Finished difference Result 212 states and 539 transitions. [2025-04-13 22:14:39,261 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:14:39,261 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 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:14:39,261 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:39,262 INFO L225 Difference]: With dead ends: 212 [2025-04-13 22:14:39,262 INFO L226 Difference]: Without dead ends: 203 [2025-04-13 22:14:39,262 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=2027, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:14:39,262 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:39,262 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:39,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-04-13 22:14:39,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 162. [2025-04-13 22:14:39,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.68944099378882) internal successors, (433), 161 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call 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:39,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 433 transitions. [2025-04-13 22:14:39,360 INFO L79 Accepts]: Start accepts. Automaton has 162 states and 433 transitions. Word has length 28 [2025-04-13 22:14:39,360 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:39,360 INFO L485 AbstractCegarLoop]: Abstraction has 162 states and 433 transitions. [2025-04-13 22:14:39,360 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6774193548387097) internal successors, (52), 32 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:14:39,360 INFO L278 IsEmpty]: Start isEmpty. Operand 162 states and 433 transitions. [2025-04-13 22:14:39,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:39,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:39,360 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:39,368 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:14:39,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:39,561 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:14:39,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:39,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1110517508, now seen corresponding path program 65 times [2025-04-13 22:14:39,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:39,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933185242] [2025-04-13 22:14:39,561 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:39,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:39,569 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:39,584 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:39,584 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:39,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:39,984 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:14:39,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:39,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933185242] [2025-04-13 22:14:39,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933185242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:39,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031786641] [2025-04-13 22:14:39,985 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:39,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:39,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:39,986 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:14:39,987 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:14:40,168 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:40,290 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,290 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:40,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:40,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:40,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:40,349 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:40,350 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 35 treesize of output 23 [2025-04-13 22:14:40,393 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:40,393 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:40,654 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:40,654 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 181 treesize of output 113 [2025-04-13 22:14:40,720 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:40,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031786641] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:40,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:40,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2025-04-13 22:14:40,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118024493] [2025-04-13 22:14:40,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:40,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:14:40,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:40,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:14:40,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:40,721 INFO L87 Difference]: Start difference. First operand 162 states and 433 transitions. Second operand has 26 states, 25 states have (on average 1.72) internal successors, (43), 26 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:14:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:41,501 INFO L93 Difference]: Finished difference Result 217 states and 548 transitions. [2025-04-13 22:14:41,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:14:41,501 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 26 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 28 [2025-04-13 22:14:41,502 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:41,502 INFO L225 Difference]: With dead ends: 217 [2025-04-13 22:14:41,502 INFO L226 Difference]: Without dead ends: 208 [2025-04-13 22:14:41,503 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=1172, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:14:41,503 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:41,503 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:41,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2025-04-13 22:14:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 156. [2025-04-13 22:14:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.6580645161290324) internal successors, (412), 155 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call 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:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 412 transitions. [2025-04-13 22:14:41,598 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 412 transitions. Word has length 28 [2025-04-13 22:14:41,598 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:41,598 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 412 transitions. [2025-04-13 22:14:41,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.72) internal successors, (43), 26 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:14:41,598 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 412 transitions. [2025-04-13 22:14:41,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:41,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:41,598 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:41,606 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:14:41,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:41,799 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:14:41,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1518979376, now seen corresponding path program 66 times [2025-04-13 22:14:41,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:41,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341366045] [2025-04-13 22:14:41,799 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:41,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:41,807 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:41,816 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:14:41,816 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:14:41,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:42,099 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:42,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:42,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341366045] [2025-04-13 22:14:42,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341366045] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:42,099 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747618467] [2025-04-13 22:14:42,100 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:42,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:42,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:42,101 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:14:42,102 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:14:42,283 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:42,305 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 22:14:42,305 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:14:42,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:42,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:14:42,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:42,390 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:42,390 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 27 treesize of output 19 [2025-04-13 22:14:42,409 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:42,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:42,616 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:42,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 173 treesize of output 107 [2025-04-13 22:14:42,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:14:42,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747618467] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:42,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:42,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:14:42,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960290876] [2025-04-13 22:14:42,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:42,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:14:42,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:42,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:14:42,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:42,706 INFO L87 Difference]: Start difference. First operand 156 states and 412 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:43,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:43,442 INFO L93 Difference]: Finished difference Result 250 states and 625 transitions. [2025-04-13 22:14:43,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:14:43,442 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:43,442 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:43,443 INFO L225 Difference]: With dead ends: 250 [2025-04-13 22:14:43,443 INFO L226 Difference]: Without dead ends: 241 [2025-04-13 22:14:43,443 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=1273, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:14:43,444 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:43,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:43,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-04-13 22:14:43,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 166. [2025-04-13 22:14:43,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.696969696969697) internal successors, (445), 165 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call 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,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 445 transitions. [2025-04-13 22:14:43,546 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 445 transitions. Word has length 28 [2025-04-13 22:14:43,546 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:43,546 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 445 transitions. [2025-04-13 22:14:43,546 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:43,546 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 445 transitions. [2025-04-13 22:14:43,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:43,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:43,546 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:43,553 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:14:43,750 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,SelfDestructingSolverStorable74 [2025-04-13 22:14:43,750 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:14:43,750 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:43,750 INFO L85 PathProgramCache]: Analyzing trace with hash 660868608, now seen corresponding path program 67 times [2025-04-13 22:14:43,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:43,750 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218070202] [2025-04-13 22:14:43,750 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:43,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:43,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:43,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:43,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:44,244 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:44,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:44,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218070202] [2025-04-13 22:14:44,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218070202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:44,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075874647] [2025-04-13 22:14:44,244 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:44,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:44,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:44,246 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:14:44,247 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:14:44,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:44,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:44,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:44,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:44,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:44,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:44,524 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:44,524 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 35 treesize of output 23 [2025-04-13 22:14:44,548 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:44,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:44,784 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:44,785 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 173 treesize of output 107 [2025-04-13 22:14:44,865 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:44,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075874647] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:44,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:44,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 32 [2025-04-13 22:14:44,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302905570] [2025-04-13 22:14:44,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:44,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:14:44,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:44,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:14:44,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:14:44,866 INFO L87 Difference]: Start difference. First operand 166 states and 445 transitions. Second operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:45,720 INFO L93 Difference]: Finished difference Result 225 states and 576 transitions. [2025-04-13 22:14:45,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:14:45,720 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:45,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:45,721 INFO L225 Difference]: With dead ends: 225 [2025-04-13 22:14:45,721 INFO L226 Difference]: Without dead ends: 216 [2025-04-13 22:14:45,722 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=315, Invalid=2135, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:14:45,722 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:45,722 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:45,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-04-13 22:14:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 162. [2025-04-13 22:14:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 2.701863354037267) internal successors, (435), 161 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call 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:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 435 transitions. [2025-04-13 22:14:45,828 INFO L79 Accepts]: Start accepts. Automaton has 162 states and 435 transitions. Word has length 28 [2025-04-13 22:14:45,828 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:45,828 INFO L485 AbstractCegarLoop]: Abstraction has 162 states and 435 transitions. [2025-04-13 22:14:45,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:45,828 INFO L278 IsEmpty]: Start isEmpty. Operand 162 states and 435 transitions. [2025-04-13 22:14:45,829 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:45,829 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:45,829 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:45,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-13 22:14:46,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:46,029 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:14:46,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:46,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1574390636, now seen corresponding path program 68 times [2025-04-13 22:14:46,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:46,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977643783] [2025-04-13 22:14:46,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:46,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:46,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:46,051 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:46,051 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:46,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:46,480 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:46,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:46,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977643783] [2025-04-13 22:14:46,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977643783] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:46,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274641561] [2025-04-13 22:14:46,480 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:46,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:46,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:46,482 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:14:46,483 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:14:46,681 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:46,707 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:46,707 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:46,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:46,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:14:46,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:46,782 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:46,782 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 27 treesize of output 19 [2025-04-13 22:14:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:14:46,817 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:47,015 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:47,015 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 173 treesize of output 107 [2025-04-13 22:14:47,092 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:47,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274641561] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:47,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:47,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:14:47,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387407936] [2025-04-13 22:14:47,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:47,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:14:47,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:47,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:14:47,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:14:47,093 INFO L87 Difference]: Start difference. First operand 162 states and 435 transitions. Second operand has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 28 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:14:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:47,905 INFO L93 Difference]: Finished difference Result 254 states and 643 transitions. [2025-04-13 22:14:47,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:14:47,906 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 28 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:14:47,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:47,907 INFO L225 Difference]: With dead ends: 254 [2025-04-13 22:14:47,907 INFO L226 Difference]: Without dead ends: 245 [2025-04-13 22:14:47,907 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=1628, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:14:47,907 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:47,907 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-13 22:14:48,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 170. [2025-04-13 22:14:48,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 2.727810650887574) internal successors, (461), 169 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call 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:48,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 461 transitions. [2025-04-13 22:14:48,020 INFO L79 Accepts]: Start accepts. Automaton has 170 states and 461 transitions. Word has length 28 [2025-04-13 22:14:48,020 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:48,020 INFO L485 AbstractCegarLoop]: Abstraction has 170 states and 461 transitions. [2025-04-13 22:14:48,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 28 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:14:48,020 INFO L278 IsEmpty]: Start isEmpty. Operand 170 states and 461 transitions. [2025-04-13 22:14:48,020 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:48,020 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:48,020 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:48,027 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:14:48,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:48,221 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:14:48,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:48,221 INFO L85 PathProgramCache]: Analyzing trace with hash 605457348, now seen corresponding path program 69 times [2025-04-13 22:14:48,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:48,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14331113] [2025-04-13 22:14:48,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:48,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:48,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:48,240 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 22:14:48,240 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:14:48,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:48,561 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:48,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:48,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14331113] [2025-04-13 22:14:48,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14331113] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:48,562 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514231702] [2025-04-13 22:14:48,562 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:14:48,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:48,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:48,564 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:14:48,565 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:14:48,755 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:48,783 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 22:14:48,783 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:14:48,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:48,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:14:48,785 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:48,853 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:48,853 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 27 treesize of output 19 [2025-04-13 22:14:48,885 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:48,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:49,080 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:49,081 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 173 treesize of output 107 [2025-04-13 22:14:49,163 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:49,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514231702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:49,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:49,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:14:49,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857046310] [2025-04-13 22:14:49,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:49,164 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:14:49,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:49,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:14:49,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:49,164 INFO L87 Difference]: Start difference. First operand 170 states and 461 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:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:49,820 INFO L93 Difference]: Finished difference Result 227 states and 575 transitions. [2025-04-13 22:14:49,820 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:14:49,820 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:49,820 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:49,821 INFO L225 Difference]: With dead ends: 227 [2025-04-13 22:14:49,821 INFO L226 Difference]: Without dead ends: 218 [2025-04-13 22:14:49,821 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1079, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:14:49,821 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:49,822 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-04-13 22:14:49,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 160. [2025-04-13 22:14:49,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 159 states have (on average 2.691823899371069) internal successors, (428), 159 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call 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:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 428 transitions. [2025-04-13 22:14:49,920 INFO L79 Accepts]: Start accepts. Automaton has 160 states and 428 transitions. Word has length 28 [2025-04-13 22:14:49,921 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:49,921 INFO L485 AbstractCegarLoop]: Abstraction has 160 states and 428 transitions. [2025-04-13 22:14:49,921 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:49,921 INFO L278 IsEmpty]: Start isEmpty. Operand 160 states and 428 transitions. [2025-04-13 22:14:49,921 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:49,921 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:49,921 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:49,928 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:14:50,121 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:50,122 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:14:50,122 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash 143953070, now seen corresponding path program 70 times [2025-04-13 22:14:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:50,122 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382627077] [2025-04-13 22:14:50,122 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:50,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:50,130 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:50,147 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:50,147 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:50,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:50,628 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:50,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:50,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382627077] [2025-04-13 22:14:50,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382627077] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:50,629 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483809348] [2025-04-13 22:14:50,629 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:14:50,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:50,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:50,630 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:14:50,631 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:14:50,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:50,842 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:50,842 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:14:50,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:50,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:50,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:50,905 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:50,905 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 35 treesize of output 23 [2025-04-13 22:14:50,946 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:50,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:51,167 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:51,167 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 173 treesize of output 107 [2025-04-13 22:14:51,251 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:51,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483809348] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:51,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:51,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 22:14:51,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781367899] [2025-04-13 22:14:51,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:51,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:14:51,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:51,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:14:51,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:14:51,252 INFO L87 Difference]: Start difference. First operand 160 states and 428 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:14:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:52,298 INFO L93 Difference]: Finished difference Result 261 states and 658 transitions. [2025-04-13 22:14:52,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:14:52,298 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 28 [2025-04-13 22:14:52,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:52,299 INFO L225 Difference]: With dead ends: 261 [2025-04-13 22:14:52,299 INFO L226 Difference]: Without dead ends: 248 [2025-04-13 22:14:52,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=365, Invalid=2287, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:14:52,299 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:52,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:52,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-04-13 22:14:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 166. [2025-04-13 22:14:52,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.696969696969697) internal successors, (445), 165 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call 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:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 445 transitions. [2025-04-13 22:14:52,403 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 445 transitions. Word has length 28 [2025-04-13 22:14:52,403 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:52,403 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 445 transitions. [2025-04-13 22:14:52,403 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:14:52,403 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 445 transitions. [2025-04-13 22:14:52,403 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:52,403 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:52,403 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:52,410 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:14:52,603 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,SelfDestructingSolverStorable78 [2025-04-13 22:14:52,604 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:14:52,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1971166242, now seen corresponding path program 71 times [2025-04-13 22:14:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:52,604 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135856546] [2025-04-13 22:14:52,604 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:52,612 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:52,626 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:52,626 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:52,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:52,970 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:14:52,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:52,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135856546] [2025-04-13 22:14:52,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135856546] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:52,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739077909] [2025-04-13 22:14:52,970 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:14:52,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:52,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:52,972 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:14:52,972 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:14:53,164 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:53,317 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:53,317 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:14:53,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:53,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:14:53,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:53,439 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:53,440 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 27 treesize of output 19 [2025-04-13 22:14:53,491 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:53,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:53,712 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:14:53,712 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 173 treesize of output 107 [2025-04-13 22:14:53,828 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:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739077909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:53,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:53,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-04-13 22:14:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359773876] [2025-04-13 22:14:53,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:53,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:14:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:53,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:14:53,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:14:53,829 INFO L87 Difference]: Start difference. First operand 166 states and 445 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) 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:14:54,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:54,622 INFO L93 Difference]: Finished difference Result 228 states and 576 transitions. [2025-04-13 22:14:54,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:14:54,622 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) 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 28 [2025-04-13 22:14:54,622 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:54,623 INFO L225 Difference]: With dead ends: 228 [2025-04-13 22:14:54,623 INFO L226 Difference]: Without dead ends: 215 [2025-04-13 22:14:54,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=283, Invalid=1697, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:14:54,623 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:54,623 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-04-13 22:14:54,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 158. [2025-04-13 22:14:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 2.6687898089171975) internal successors, (419), 157 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call 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,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 419 transitions. [2025-04-13 22:14:54,727 INFO L79 Accepts]: Start accepts. Automaton has 158 states and 419 transitions. Word has length 28 [2025-04-13 22:14:54,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:54,727 INFO L485 AbstractCegarLoop]: Abstraction has 158 states and 419 transitions. [2025-04-13 22:14:54,728 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.8275862068965518) 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:14:54,728 INFO L278 IsEmpty]: Start isEmpty. Operand 158 states and 419 transitions. [2025-04-13 22:14:54,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:54,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:54,728 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:54,735 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:14:54,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:54,928 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:14:54,929 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1873000404, now seen corresponding path program 72 times [2025-04-13 22:14:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:54,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403724262] [2025-04-13 22:14:54,929 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:54,937 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:54,952 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:54,952 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:54,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:55,343 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,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:55,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403724262] [2025-04-13 22:14:55,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403724262] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:55,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470657206] [2025-04-13 22:14:55,344 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:14:55,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:55,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:55,346 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:14:55,347 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:14:55,546 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 22:14:55,627 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:55,628 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:14:55,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:55,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:14:55,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:55,712 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:55,712 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 27 treesize of output 19 [2025-04-13 22:14:55,759 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,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:55,960 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:55,961 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 144 treesize of output 123 [2025-04-13 22:14:56,145 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:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470657206] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:56,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:56,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:14:56,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151774589] [2025-04-13 22:14:56,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:56,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:14:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:56,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:14:56,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:14:56,146 INFO L87 Difference]: Start difference. First operand 158 states and 419 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:56,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:56,741 INFO L93 Difference]: Finished difference Result 196 states and 500 transitions. [2025-04-13 22:14:56,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:14:56,741 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:56,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:56,742 INFO L225 Difference]: With dead ends: 196 [2025-04-13 22:14:56,742 INFO L226 Difference]: Without dead ends: 181 [2025-04-13 22:14:56,742 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:14:56,743 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:56,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:56,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-04-13 22:14:56,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 166. [2025-04-13 22:14:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.696969696969697) internal successors, (445), 165 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call 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:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 445 transitions. [2025-04-13 22:14:56,848 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 445 transitions. Word has length 28 [2025-04-13 22:14:56,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:56,848 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 445 transitions. [2025-04-13 22:14:56,848 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:56,848 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 445 transitions. [2025-04-13 22:14:56,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:56,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:56,848 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:56,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-04-13 22:14:57,049 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:57,049 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:14:57,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:57,049 INFO L85 PathProgramCache]: Analyzing trace with hash -242118908, now seen corresponding path program 73 times [2025-04-13 22:14:57,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:57,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340323591] [2025-04-13 22:14:57,049 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:57,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:57,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:57,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:57,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:57,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:57,610 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:57,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:14:57,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340323591] [2025-04-13 22:14:57,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340323591] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:14:57,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597994951] [2025-04-13 22:14:57,610 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:14:57,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:14:57,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:14:57,612 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:14:57,613 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:14:57,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 22:14:57,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 22:14:57,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:14:57,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:14:57,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 22:14:57,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:14:57,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:14:57,904 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 35 treesize of output 23 [2025-04-13 22:14:57,959 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:57,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:14:58,213 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:14:58,214 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 181 treesize of output 113 [2025-04-13 22:14:58,277 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:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597994951] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:14:58,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:14:58,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 32 [2025-04-13 22:14:58,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85243516] [2025-04-13 22:14:58,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:14:58,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:14:58,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:14:58,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:14:58,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:14:58,278 INFO L87 Difference]: Start difference. First operand 166 states and 445 transitions. Second operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:14:59,375 INFO L93 Difference]: Finished difference Result 240 states and 610 transitions. [2025-04-13 22:14:59,375 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:14:59,375 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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,375 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:14:59,376 INFO L225 Difference]: With dead ends: 240 [2025-04-13 22:14:59,376 INFO L226 Difference]: Without dead ends: 227 [2025-04-13 22:14:59,376 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=2306, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:14:59,376 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:14:59,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:14:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-04-13 22:14:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 164. [2025-04-13 22:14:59,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 163 states have (on average 2.6993865030674846) internal successors, (440), 163 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call 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,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 440 transitions. [2025-04-13 22:14:59,483 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 440 transitions. Word has length 28 [2025-04-13 22:14:59,483 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:14:59,483 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 440 transitions. [2025-04-13 22:14:59,483 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,483 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 440 transitions. [2025-04-13 22:14:59,483 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 22:14:59,483 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:14:59,483 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,491 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:14:59,683 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,SelfDestructingSolverStorable81 [2025-04-13 22:14:59,683 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:14:59,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:14:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1128297906, now seen corresponding path program 74 times [2025-04-13 22:14:59,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:14:59,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592375673] [2025-04-13 22:14:59,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:14:59,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:14:59,692 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:14:59,703 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:59,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:14:59,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:00,107 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:15:00,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:00,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592375673] [2025-04-13 22:15:00,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592375673] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:00,107 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665738425] [2025-04-13 22:15:00,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:00,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:00,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:00,109 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:15:00,109 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:15:00,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 22:15:00,332 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:00,332 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:00,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:00,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:15:00,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:00,399 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:00,399 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 27 treesize of output 19 [2025-04-13 22:15:00,434 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:15:00,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:00,705 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:15:00,705 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 134 treesize of output 83 [2025-04-13 22:15:00,749 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,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665738425] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:00,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:00,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 26 [2025-04-13 22:15:00,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109148381] [2025-04-13 22:15:00,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:00,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:15:00,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:00,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:15:00,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:15:00,750 INFO L87 Difference]: Start difference. First operand 164 states and 440 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:15:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:01,475 INFO L93 Difference]: Finished difference Result 225 states and 578 transitions. [2025-04-13 22:15:01,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:15:01,475 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 28 [2025-04-13 22:15:01,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:01,476 INFO L225 Difference]: With dead ends: 225 [2025-04-13 22:15:01,476 INFO L226 Difference]: Without dead ends: 220 [2025-04-13 22:15:01,477 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:15:01,477 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:01,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:01,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-04-13 22:15:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 173. [2025-04-13 22:15:01,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 172 states have (on average 2.6744186046511627) internal successors, (460), 172 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call 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:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 460 transitions. [2025-04-13 22:15:01,584 INFO L79 Accepts]: Start accepts. Automaton has 173 states and 460 transitions. Word has length 28 [2025-04-13 22:15:01,584 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:01,584 INFO L485 AbstractCegarLoop]: Abstraction has 173 states and 460 transitions. [2025-04-13 22:15:01,584 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:15:01,584 INFO L278 IsEmpty]: Start isEmpty. Operand 173 states and 460 transitions. [2025-04-13 22:15:01,584 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:01,584 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:01,584 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:15:01,592 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:15:01,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:01,785 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:15:01,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:01,785 INFO L85 PathProgramCache]: Analyzing trace with hash -396001855, now seen corresponding path program 75 times [2025-04-13 22:15:01,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:01,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106299647] [2025-04-13 22:15:01,785 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:01,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:01,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:01,810 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:15:01,810 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:01,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:02,160 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:02,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:02,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106299647] [2025-04-13 22:15:02,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106299647] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:02,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381934675] [2025-04-13 22:15:02,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:02,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:02,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:02,163 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:15:02,163 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:15:02,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:02,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:15:02,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:02,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:02,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:15:02,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:02,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:02,781 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:15:02,782 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 67 treesize of output 71 [2025-04-13 22:15:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381934675] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:02,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 27 [2025-04-13 22:15:02,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928623892] [2025-04-13 22:15:02,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:02,824 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:15:02,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:02,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:15:02,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:15:02,825 INFO L87 Difference]: Start difference. First operand 173 states and 460 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:03,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:03,372 INFO L93 Difference]: Finished difference Result 220 states and 560 transitions. [2025-04-13 22:15:03,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:15:03,372 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:15:03,372 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:03,373 INFO L225 Difference]: With dead ends: 220 [2025-04-13 22:15:03,373 INFO L226 Difference]: Without dead ends: 205 [2025-04-13 22:15:03,373 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=885, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:15:03,373 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:03,373 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-04-13 22:15:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 171. [2025-04-13 22:15:03,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.676470588235294) internal successors, (455), 170 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call 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,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 455 transitions. [2025-04-13 22:15:03,481 INFO L79 Accepts]: Start accepts. Automaton has 171 states and 455 transitions. Word has length 29 [2025-04-13 22:15:03,481 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:03,481 INFO L485 AbstractCegarLoop]: Abstraction has 171 states and 455 transitions. [2025-04-13 22:15:03,481 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:03,481 INFO L278 IsEmpty]: Start isEmpty. Operand 171 states and 455 transitions. [2025-04-13 22:15:03,481 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:03,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:03,482 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:15:03,489 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:15:03,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:03,682 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:15:03,682 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:03,682 INFO L85 PathProgramCache]: Analyzing trace with hash 6164489, now seen corresponding path program 76 times [2025-04-13 22:15:03,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:03,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946362848] [2025-04-13 22:15:03,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:03,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:03,695 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:03,710 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:03,710 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:03,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:04,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946362848] [2025-04-13 22:15:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946362848] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:04,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647494477] [2025-04-13 22:15:04,148 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:04,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:04,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:04,150 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:15:04,151 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:15:04,361 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:04,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:04,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:04,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:04,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:04,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:04,476 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:04,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:04,568 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:04,569 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 73 treesize of output 94 [2025-04-13 22:15:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:04,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647494477] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:04,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:04,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:15:04,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903857355] [2025-04-13 22:15:04,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:04,624 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:15:04,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:04,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:15:04,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:15:04,625 INFO L87 Difference]: Start difference. First operand 171 states and 455 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) 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:15:05,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:05,189 INFO L93 Difference]: Finished difference Result 201 states and 505 transitions. [2025-04-13 22:15:05,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:15:05,189 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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 29 [2025-04-13 22:15:05,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:05,190 INFO L225 Difference]: With dead ends: 201 [2025-04-13 22:15:05,190 INFO L226 Difference]: Without dead ends: 188 [2025-04-13 22:15:05,191 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1664, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:15:05,191 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 52 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:05,191 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 0 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-04-13 22:15:05,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 179. [2025-04-13 22:15:05,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 2.657303370786517) internal successors, (473), 178 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call 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:05,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 473 transitions. [2025-04-13 22:15:05,314 INFO L79 Accepts]: Start accepts. Automaton has 179 states and 473 transitions. Word has length 29 [2025-04-13 22:15:05,314 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:05,314 INFO L485 AbstractCegarLoop]: Abstraction has 179 states and 473 transitions. [2025-04-13 22:15:05,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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:15:05,314 INFO L278 IsEmpty]: Start isEmpty. Operand 179 states and 473 transitions. [2025-04-13 22:15:05,314 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:05,314 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:05,315 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:15:05,322 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:15:05,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:05,515 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:15:05,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:05,515 INFO L85 PathProgramCache]: Analyzing trace with hash 2144651702, now seen corresponding path program 77 times [2025-04-13 22:15:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:05,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830568310] [2025-04-13 22:15:05,515 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:05,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:05,524 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:05,538 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:05,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:05,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:05,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830568310] [2025-04-13 22:15:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830568310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:05,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1842005057] [2025-04-13 22:15:05,857 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:05,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:05,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:05,859 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:15:05,860 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:15:06,064 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:06,140 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:06,141 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:06,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:06,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 22:15:06,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:06,300 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:15:06,300 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 29 treesize of output 9 [2025-04-13 22:15:06,317 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:15:06,317 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:06,481 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:15:06,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 36 treesize of output 52 [2025-04-13 22:15:06,499 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:15:06,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1842005057] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:06,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:06,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2025-04-13 22:15:06,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816244402] [2025-04-13 22:15:06,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:06,499 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:15:06,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:06,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:15:06,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:15:06,499 INFO L87 Difference]: Start difference. First operand 179 states and 473 transitions. Second operand has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 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:15:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:07,348 INFO L93 Difference]: Finished difference Result 280 states and 716 transitions. [2025-04-13 22:15:07,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:15:07,349 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 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:15:07,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:07,350 INFO L225 Difference]: With dead ends: 280 [2025-04-13 22:15:07,350 INFO L226 Difference]: Without dead ends: 272 [2025-04-13 22:15:07,350 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=316, Invalid=1754, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:15:07,350 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:07,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-13 22:15:07,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 181. [2025-04-13 22:15:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 2.6666666666666665) internal successors, (480), 180 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call 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:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 480 transitions. [2025-04-13 22:15:07,474 INFO L79 Accepts]: Start accepts. Automaton has 181 states and 480 transitions. Word has length 29 [2025-04-13 22:15:07,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:07,475 INFO L485 AbstractCegarLoop]: Abstraction has 181 states and 480 transitions. [2025-04-13 22:15:07,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 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:15:07,475 INFO L278 IsEmpty]: Start isEmpty. Operand 181 states and 480 transitions. [2025-04-13 22:15:07,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:07,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:07,475 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:15:07,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Ended with exit code 0 [2025-04-13 22:15:07,675 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,SelfDestructingSolverStorable85 [2025-04-13 22:15:07,675 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:15:07,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:07,676 INFO L85 PathProgramCache]: Analyzing trace with hash -936891344, now seen corresponding path program 78 times [2025-04-13 22:15:07,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:07,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158282484] [2025-04-13 22:15:07,676 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:07,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:07,684 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:07,700 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:07,700 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:07,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:07,978 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:07,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:07,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158282484] [2025-04-13 22:15:07,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158282484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:07,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646514337] [2025-04-13 22:15:07,979 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:07,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:07,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:07,980 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:15:07,981 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:15:08,197 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:08,338 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:08,338 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:08,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:08,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:15:08,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:08,507 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:15:08,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:08,611 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:08,611 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:15:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:08,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646514337] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:08,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:08,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2025-04-13 22:15:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189397602] [2025-04-13 22:15:08,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:08,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:15:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:08,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:15:08,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:08,686 INFO L87 Difference]: Start difference. First operand 181 states and 480 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:09,272 INFO L93 Difference]: Finished difference Result 227 states and 589 transitions. [2025-04-13 22:15:09,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:15:09,272 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:15:09,272 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:09,273 INFO L225 Difference]: With dead ends: 227 [2025-04-13 22:15:09,273 INFO L226 Difference]: Without dead ends: 219 [2025-04-13 22:15:09,274 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1301, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:15:09,274 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:09,274 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:09,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-04-13 22:15:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 185. [2025-04-13 22:15:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.6956521739130435) internal successors, (496), 184 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call 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,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 496 transitions. [2025-04-13 22:15:09,402 INFO L79 Accepts]: Start accepts. Automaton has 185 states and 496 transitions. Word has length 29 [2025-04-13 22:15:09,402 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:09,402 INFO L485 AbstractCegarLoop]: Abstraction has 185 states and 496 transitions. [2025-04-13 22:15:09,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:09,402 INFO L278 IsEmpty]: Start isEmpty. Operand 185 states and 496 transitions. [2025-04-13 22:15:09,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:09,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:09,402 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:15:09,409 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:15:09,602 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,SelfDestructingSolverStorable86 [2025-04-13 22:15:09,603 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:15:09,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash -158181483, now seen corresponding path program 79 times [2025-04-13 22:15:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:09,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408882169] [2025-04-13 22:15:09,603 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:09,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:15:09,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:09,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:09,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:10,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:10,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408882169] [2025-04-13 22:15:10,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408882169] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:10,093 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939140924] [2025-04-13 22:15:10,093 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:10,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:10,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:10,095 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:15:10,095 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:15:10,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:15:10,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:10,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:10,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:10,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:15:10,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:10,431 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:10,547 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:15:10,547 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 67 treesize of output 71 [2025-04-13 22:15:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939140924] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:10,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:10,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:15:10,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560175379] [2025-04-13 22:15:10,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:10,561 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:10,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:10,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:10,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:10,562 INFO L87 Difference]: Start difference. First operand 185 states and 496 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:11,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:11,215 INFO L93 Difference]: Finished difference Result 236 states and 606 transitions. [2025-04-13 22:15:11,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:15:11,215 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:15:11,215 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:11,216 INFO L225 Difference]: With dead ends: 236 [2025-04-13 22:15:11,216 INFO L226 Difference]: Without dead ends: 223 [2025-04-13 22:15:11,216 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1350, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:15:11,216 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 62 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:11,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 0 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:11,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-04-13 22:15:11,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 187. [2025-04-13 22:15:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 2.693548387096774) internal successors, (501), 186 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call 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:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 501 transitions. [2025-04-13 22:15:11,349 INFO L79 Accepts]: Start accepts. Automaton has 187 states and 501 transitions. Word has length 29 [2025-04-13 22:15:11,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:11,349 INFO L485 AbstractCegarLoop]: Abstraction has 187 states and 501 transitions. [2025-04-13 22:15:11,349 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:11,350 INFO L278 IsEmpty]: Start isEmpty. Operand 187 states and 501 transitions. [2025-04-13 22:15:11,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:11,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:11,350 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:15:11,357 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:15:11,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2025-04-13 22:15:11,550 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:15:11,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:11,551 INFO L85 PathProgramCache]: Analyzing trace with hash 754618097, now seen corresponding path program 80 times [2025-04-13 22:15:11,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:11,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855340617] [2025-04-13 22:15:11,551 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:11,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:11,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:11,573 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:11,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:11,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:15:12,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:12,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855340617] [2025-04-13 22:15:12,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855340617] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:12,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1367251115] [2025-04-13 22:15:12,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:12,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:12,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:12,199 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:15:12,199 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:15:12,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:12,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:12,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:12,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:12,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:15:12,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:12,674 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:15:12,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:12,786 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:12,786 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 73 treesize of output 94 [2025-04-13 22:15:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1367251115] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:12,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 9] total 33 [2025-04-13 22:15:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174814841] [2025-04-13 22:15:12,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:12,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:15:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:12,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:15:12,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:15:12,863 INFO L87 Difference]: Start difference. First operand 187 states and 501 transitions. Second operand has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 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:13,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:13,612 INFO L93 Difference]: Finished difference Result 269 states and 671 transitions. [2025-04-13 22:15:13,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:15:13,612 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 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 29 [2025-04-13 22:15:13,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:13,613 INFO L225 Difference]: With dead ends: 269 [2025-04-13 22:15:13,613 INFO L226 Difference]: Without dead ends: 256 [2025-04-13 22:15:13,613 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 655 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:15:13,613 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:13,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-04-13 22:15:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 199. [2025-04-13 22:15:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.7626262626262625) internal successors, (547), 198 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call 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:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 547 transitions. [2025-04-13 22:15:13,756 INFO L79 Accepts]: Start accepts. Automaton has 199 states and 547 transitions. Word has length 29 [2025-04-13 22:15:13,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:13,756 INFO L485 AbstractCegarLoop]: Abstraction has 199 states and 547 transitions. [2025-04-13 22:15:13,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 33 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:13,756 INFO L278 IsEmpty]: Start isEmpty. Operand 199 states and 547 transitions. [2025-04-13 22:15:13,757 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:13,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:13,757 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:15:13,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2025-04-13 22:15:13,957 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,SelfDestructingSolverStorable88 [2025-04-13 22:15:13,957 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:15:13,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash -935331082, now seen corresponding path program 81 times [2025-04-13 22:15:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:13,958 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807928212] [2025-04-13 22:15:13,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:13,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:13,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:13,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 22:15:13,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:13,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:14,303 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:14,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:14,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807928212] [2025-04-13 22:15:14,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807928212] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:14,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378330220] [2025-04-13 22:15:14,304 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:14,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:14,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:14,305 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:15:14,306 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:15:14,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:14,543 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 22:15:14,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:15:14,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:14,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:15:14,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:14,721 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:14,722 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:14,839 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:15:14,839 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 36 treesize of output 52 [2025-04-13 22:15:14,872 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:14,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378330220] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:14,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:14,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:15:14,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569811509] [2025-04-13 22:15:14,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:14,872 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:15:14,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:14,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:15:14,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:15:14,873 INFO L87 Difference]: Start difference. First operand 199 states and 547 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:15:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:15,464 INFO L93 Difference]: Finished difference Result 281 states and 753 transitions. [2025-04-13 22:15:15,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:15:15,464 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:15:15,465 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:15,466 INFO L225 Difference]: With dead ends: 281 [2025-04-13 22:15:15,466 INFO L226 Difference]: Without dead ends: 273 [2025-04-13 22:15:15,466 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:15,466 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:15,466 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:15,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-04-13 22:15:15,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 199. [2025-04-13 22:15:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 198 states have (on average 2.7626262626262625) internal successors, (547), 198 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call 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,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 547 transitions. [2025-04-13 22:15:15,608 INFO L79 Accepts]: Start accepts. Automaton has 199 states and 547 transitions. Word has length 29 [2025-04-13 22:15:15,608 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:15,608 INFO L485 AbstractCegarLoop]: Abstraction has 199 states and 547 transitions. [2025-04-13 22:15:15,609 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:15:15,609 INFO L278 IsEmpty]: Start isEmpty. Operand 199 states and 547 transitions. [2025-04-13 22:15:15,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:15,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:15,609 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:15:15,616 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:15:15,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:15,809 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:15:15,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1699380080, now seen corresponding path program 82 times [2025-04-13 22:15:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:15,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661613692] [2025-04-13 22:15:15,810 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:15,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:15,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:15,830 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:15,830 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:15,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:16,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:16,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661613692] [2025-04-13 22:15:16,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661613692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:16,266 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498158726] [2025-04-13 22:15:16,266 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:16,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:16,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:16,267 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:15:16,268 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:15:16,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:16,507 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:16,508 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:16,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:16,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:16,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:16,616 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:15:16,616 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 33 treesize of output 9 [2025-04-13 22:15:16,617 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:16,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:16,746 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:16,746 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:15:16,797 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:16,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498158726] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:16,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:16,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:15:16,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391292954] [2025-04-13 22:15:16,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:16,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:16,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:16,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:16,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:16,798 INFO L87 Difference]: Start difference. First operand 199 states and 547 transitions. Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:17,664 INFO L93 Difference]: Finished difference Result 261 states and 702 transitions. [2025-04-13 22:15:17,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:15:17,665 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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:15:17,665 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:17,666 INFO L225 Difference]: With dead ends: 261 [2025-04-13 22:15:17,666 INFO L226 Difference]: Without dead ends: 249 [2025-04-13 22:15:17,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 581 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=313, Invalid=2237, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:15:17,666 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:17,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-04-13 22:15:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 189. [2025-04-13 22:15:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 2.723404255319149) internal successors, (512), 188 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call 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:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 512 transitions. [2025-04-13 22:15:17,801 INFO L79 Accepts]: Start accepts. Automaton has 189 states and 512 transitions. Word has length 29 [2025-04-13 22:15:17,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:17,801 INFO L485 AbstractCegarLoop]: Abstraction has 189 states and 512 transitions. [2025-04-13 22:15:17,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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:17,801 INFO L278 IsEmpty]: Start isEmpty. Operand 189 states and 512 transitions. [2025-04-13 22:15:17,801 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:17,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:17,802 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:15:17,809 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:15:18,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:18,002 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:15:18,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:18,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1868794791, now seen corresponding path program 83 times [2025-04-13 22:15:18,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:18,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847407512] [2025-04-13 22:15:18,003 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:18,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:18,012 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:18,026 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:18,026 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:18,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:18,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:18,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847407512] [2025-04-13 22:15:18,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847407512] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:18,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676071393] [2025-04-13 22:15:18,437 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:18,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:18,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:18,441 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:15:18,442 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:15:18,669 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:18,880 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:18,880 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:18,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:18,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 22:15:18,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:19,112 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:15:19,112 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 30 treesize of output 19 [2025-04-13 22:15:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:19,125 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:19,310 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:15:19,311 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 67 treesize of output 71 [2025-04-13 22:15:19,357 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:19,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676071393] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:19,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:19,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 29 [2025-04-13 22:15:19,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656707398] [2025-04-13 22:15:19,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:19,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:19,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:19,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:19,358 INFO L87 Difference]: Start difference. First operand 189 states and 512 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:20,166 INFO L93 Difference]: Finished difference Result 254 states and 669 transitions. [2025-04-13 22:15:20,166 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:15:20,166 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:15:20,167 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:20,168 INFO L225 Difference]: With dead ends: 254 [2025-04-13 22:15:20,168 INFO L226 Difference]: Without dead ends: 243 [2025-04-13 22:15:20,168 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1359, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:15:20,168 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:20,168 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-04-13 22:15:20,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 191. [2025-04-13 22:15:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.721052631578947) internal successors, (517), 190 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call 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,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 517 transitions. [2025-04-13 22:15:20,307 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 517 transitions. Word has length 29 [2025-04-13 22:15:20,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:20,307 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 517 transitions. [2025-04-13 22:15:20,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,307 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 517 transitions. [2025-04-13 22:15:20,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:20,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:20,308 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:15:20,317 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:15:20,508 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:20,508 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:15:20,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:20,509 INFO L85 PathProgramCache]: Analyzing trace with hash -963130963, now seen corresponding path program 84 times [2025-04-13 22:15:20,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:20,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719606043] [2025-04-13 22:15:20,509 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:20,517 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:20,527 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 29 statements. [2025-04-13 22:15:20,527 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:20,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:20,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719606043] [2025-04-13 22:15:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719606043] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:20,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839141051] [2025-04-13 22:15:20,878 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:20,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:20,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:20,880 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:15:20,880 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:15:21,100 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:21,128 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 25 of 29 statements. [2025-04-13 22:15:21,128 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 22:15:21,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:21,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:15:21,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:21,271 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:21,271 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 46 treesize of output 30 [2025-04-13 22:15:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:21,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:21,424 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:21,425 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 73 treesize of output 94 [2025-04-13 22:15:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:21,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839141051] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:21,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:21,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 22:15:21,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730646598] [2025-04-13 22:15:21,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:21,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:15:21,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:21,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:15:21,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:21,506 INFO L87 Difference]: Start difference. First operand 191 states and 517 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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:22,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:22,290 INFO L93 Difference]: Finished difference Result 278 states and 712 transitions. [2025-04-13 22:15:22,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:15:22,290 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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 29 [2025-04-13 22:15:22,290 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:22,291 INFO L225 Difference]: With dead ends: 278 [2025-04-13 22:15:22,291 INFO L226 Difference]: Without dead ends: 265 [2025-04-13 22:15:22,291 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=1265, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:15:22,291 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:22,291 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-04-13 22:15:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 191. [2025-04-13 22:15:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 2.721052631578947) internal successors, (517), 190 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call 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:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 517 transitions. [2025-04-13 22:15:22,431 INFO L79 Accepts]: Start accepts. Automaton has 191 states and 517 transitions. Word has length 29 [2025-04-13 22:15:22,431 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:22,431 INFO L485 AbstractCegarLoop]: Abstraction has 191 states and 517 transitions. [2025-04-13 22:15:22,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 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:22,431 INFO L278 IsEmpty]: Start isEmpty. Operand 191 states and 517 transitions. [2025-04-13 22:15:22,431 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:22,431 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:22,431 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:15:22,439 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:15:22,632 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:22,632 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:15:22,632 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:22,632 INFO L85 PathProgramCache]: Analyzing trace with hash -924032808, now seen corresponding path program 85 times [2025-04-13 22:15:22,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:22,632 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902030699] [2025-04-13 22:15:22,632 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:22,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:22,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:15:22,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:22,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:22,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:23,112 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:23,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:23,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902030699] [2025-04-13 22:15:23,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902030699] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:23,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103455224] [2025-04-13 22:15:23,113 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:23,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:23,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:23,115 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:15:23,115 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:15:23,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:15:23,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:23,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:23,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:23,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:15:23,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:23,528 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:15:23,528 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 33 treesize of output 9 [2025-04-13 22:15:23,543 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:23,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:23,884 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:15:23,885 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 36 treesize of output 52 [2025-04-13 22:15:23,892 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:23,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103455224] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:23,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:23,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 32 [2025-04-13 22:15:23,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034794107] [2025-04-13 22:15:23,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:23,893 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:15:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:23,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:15:23,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:15:23,893 INFO L87 Difference]: Start difference. First operand 191 states and 517 transitions. Second operand has 32 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:25,573 INFO L93 Difference]: Finished difference Result 313 states and 775 transitions. [2025-04-13 22:15:25,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:15:25,573 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:15:25,573 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:25,575 INFO L225 Difference]: With dead ends: 313 [2025-04-13 22:15:25,575 INFO L226 Difference]: Without dead ends: 301 [2025-04-13 22:15:25,575 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=416, Invalid=2890, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:15:25,575 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:25,575 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:15:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-13 22:15:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 193. [2025-04-13 22:15:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.7395833333333335) internal successors, (526), 192 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call 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:25,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 526 transitions. [2025-04-13 22:15:25,727 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 526 transitions. Word has length 29 [2025-04-13 22:15:25,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:25,727 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 526 transitions. [2025-04-13 22:15:25,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:25,727 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 526 transitions. [2025-04-13 22:15:25,728 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:25,728 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:25,728 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:15:25,735 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:15:25,928 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:25,928 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:15:25,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash -932654770, now seen corresponding path program 86 times [2025-04-13 22:15:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:25,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774974005] [2025-04-13 22:15:25,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:25,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:25,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:25,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:25,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:26,624 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:15:26,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:26,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774974005] [2025-04-13 22:15:26,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774974005] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:26,625 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963358298] [2025-04-13 22:15:26,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:26,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:26,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:26,626 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:15:26,627 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:15:26,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:26,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:26,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:26,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:26,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:15:26,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:27,062 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:27,062 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 65 treesize of output 41 [2025-04-13 22:15:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:15:27,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:27,226 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:27,226 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:15:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963358298] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:27,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 9] total 34 [2025-04-13 22:15:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946881970] [2025-04-13 22:15:27,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:27,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:15:27,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:27,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:15:27,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:15:27,302 INFO L87 Difference]: Start difference. First operand 193 states and 526 transitions. Second operand has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 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:15:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:28,775 INFO L93 Difference]: Finished difference Result 292 states and 742 transitions. [2025-04-13 22:15:28,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:15:28,775 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 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 29 [2025-04-13 22:15:28,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:28,777 INFO L225 Difference]: With dead ends: 292 [2025-04-13 22:15:28,777 INFO L226 Difference]: Without dead ends: 284 [2025-04-13 22:15:28,777 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=460, Invalid=3322, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:15:28,777 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:28,777 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:15:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-13 22:15:28,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 193. [2025-04-13 22:15:28,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.7395833333333335) internal successors, (526), 192 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call 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,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 526 transitions. [2025-04-13 22:15:28,933 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 526 transitions. Word has length 29 [2025-04-13 22:15:28,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:28,933 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 526 transitions. [2025-04-13 22:15:28,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 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:15:28,934 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 526 transitions. [2025-04-13 22:15:28,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:28,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:28,934 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:15:28,942 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:15:29,134 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,SelfDestructingSolverStorable94 [2025-04-13 22:15:29,134 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:15:29,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:29,135 INFO L85 PathProgramCache]: Analyzing trace with hash 738899638, now seen corresponding path program 87 times [2025-04-13 22:15:29,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:29,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573062126] [2025-04-13 22:15:29,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:29,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:29,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:29,159 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:15:29,159 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:29,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:29,501 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:15:29,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:29,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573062126] [2025-04-13 22:15:29,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573062126] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:29,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952990194] [2025-04-13 22:15:29,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:29,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:29,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:29,503 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:15:29,504 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:15:29,729 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:29,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:15:29,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:29,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:29,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:15:29,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:30,003 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:30,003 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 46 treesize of output 30 [2025-04-13 22:15:30,041 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:15:30,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:30,161 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:15:30,162 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 36 treesize of output 52 [2025-04-13 22:15:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:30,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952990194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:30,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:30,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:15:30,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597332566] [2025-04-13 22:15:30,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:30,188 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:15:30,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:30,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:15:30,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:15:30,188 INFO L87 Difference]: Start difference. First operand 193 states and 526 transitions. Second operand has 25 states, 25 states have (on average 2.08) 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:15:31,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:31,151 INFO L93 Difference]: Finished difference Result 278 states and 717 transitions. [2025-04-13 22:15:31,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:15:31,152 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) 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 29 [2025-04-13 22:15:31,152 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:31,153 INFO L225 Difference]: With dead ends: 278 [2025-04-13 22:15:31,153 INFO L226 Difference]: Without dead ends: 270 [2025-04-13 22:15:31,153 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:15:31,153 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:31,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:31,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-13 22:15:31,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 193. [2025-04-13 22:15:31,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.7395833333333335) internal successors, (526), 192 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call 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,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 526 transitions. [2025-04-13 22:15:31,309 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 526 transitions. Word has length 29 [2025-04-13 22:15:31,309 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:31,309 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 526 transitions. [2025-04-13 22:15:31,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) 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:15:31,309 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 526 transitions. [2025-04-13 22:15:31,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:31,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:31,309 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:15:31,317 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:15:31,510 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,SelfDestructingSolverStorable95 [2025-04-13 22:15:31,510 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:15:31,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1046158480, now seen corresponding path program 88 times [2025-04-13 22:15:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:31,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771963397] [2025-04-13 22:15:31,510 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:31,519 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:31,530 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:31,530 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:31,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:31,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771963397] [2025-04-13 22:15:31,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771963397] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:31,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154761128] [2025-04-13 22:15:31,993 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:31,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:31,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:31,995 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:15:31,996 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:15:32,224 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:32,250 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:32,250 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:32,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:32,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:32,341 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:32,341 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 58 treesize of output 34 [2025-04-13 22:15:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:32,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:32,500 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:32,500 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:15:32,545 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:32,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154761128] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:32,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:32,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:15:32,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818865031] [2025-04-13 22:15:32,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:32,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:15:32,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:32,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:15:32,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=757, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:15:32,546 INFO L87 Difference]: Start difference. First operand 193 states and 526 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) 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:15:33,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:33,579 INFO L93 Difference]: Finished difference Result 252 states and 650 transitions. [2025-04-13 22:15:33,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:15:33,580 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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 29 [2025-04-13 22:15:33,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:33,581 INFO L225 Difference]: With dead ends: 252 [2025-04-13 22:15:33,581 INFO L226 Difference]: Without dead ends: 238 [2025-04-13 22:15:33,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=310, Invalid=2140, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:15:33,581 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:33,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-04-13 22:15:33,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 193. [2025-04-13 22:15:33,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.71875) internal successors, (522), 192 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:15:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 522 transitions. [2025-04-13 22:15:33,725 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 522 transitions. Word has length 29 [2025-04-13 22:15:33,725 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:33,725 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 522 transitions. [2025-04-13 22:15:33,725 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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:15:33,725 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 522 transitions. [2025-04-13 22:15:33,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:33,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:33,725 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:15:33,733 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:15:33,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:33,926 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:15:33,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash 625395928, now seen corresponding path program 89 times [2025-04-13 22:15:33,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:33,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309492745] [2025-04-13 22:15:33,926 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:33,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:33,935 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:33,949 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:33,949 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:33,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:34,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:34,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309492745] [2025-04-13 22:15:34,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309492745] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:34,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108266216] [2025-04-13 22:15:34,303 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:34,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:34,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:34,305 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:15:34,305 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:15:34,534 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:34,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:34,578 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:34,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:34,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:15:34,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:34,701 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:34,702 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 73 treesize of output 45 [2025-04-13 22:15:34,731 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:34,731 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:34,863 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:15:34,863 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 36 treesize of output 52 [2025-04-13 22:15:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108266216] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:34,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 25 [2025-04-13 22:15:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278540704] [2025-04-13 22:15:34,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:34,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:15:34,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:34,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:15:34,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:15:34,871 INFO L87 Difference]: Start difference. First operand 193 states and 522 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:15:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:35,575 INFO L93 Difference]: Finished difference Result 262 states and 675 transitions. [2025-04-13 22:15:35,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:15:35,576 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:15:35,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:35,577 INFO L225 Difference]: With dead ends: 262 [2025-04-13 22:15:35,577 INFO L226 Difference]: Without dead ends: 251 [2025-04-13 22:15:35,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:15:35,577 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:35,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-04-13 22:15:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 193. [2025-04-13 22:15:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.7083333333333335) internal successors, (520), 192 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call 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,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 520 transitions. [2025-04-13 22:15:35,722 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 520 transitions. Word has length 29 [2025-04-13 22:15:35,722 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:35,722 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 520 transitions. [2025-04-13 22:15:35,722 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:15:35,722 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 520 transitions. [2025-04-13 22:15:35,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:35,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:35,722 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:15:35,730 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:15:35,923 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:35,923 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:15:35,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:35,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1018542223, now seen corresponding path program 90 times [2025-04-13 22:15:35,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:35,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463648569] [2025-04-13 22:15:35,923 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:35,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:35,932 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:35,948 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:35,949 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:35,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:36,301 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:15:36,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:36,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463648569] [2025-04-13 22:15:36,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463648569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:36,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580783818] [2025-04-13 22:15:36,302 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:36,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:36,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:36,303 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:15:36,304 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:15:36,533 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:36,569 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:36,569 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:36,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:36,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:15:36,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:36,733 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:36,734 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 65 treesize of output 41 [2025-04-13 22:15:36,761 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:15:36,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:36,877 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:36,877 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 73 treesize of output 94 [2025-04-13 22:15:36,968 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:36,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580783818] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:36,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:36,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2025-04-13 22:15:36,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524143187] [2025-04-13 22:15:36,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:36,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:15:36,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:36,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:15:36,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:36,969 INFO L87 Difference]: Start difference. First operand 193 states and 520 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) 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:15:37,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:37,698 INFO L93 Difference]: Finished difference Result 236 states and 623 transitions. [2025-04-13 22:15:37,698 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:15:37,698 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) 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 29 [2025-04-13 22:15:37,698 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:37,699 INFO L225 Difference]: With dead ends: 236 [2025-04-13 22:15:37,699 INFO L226 Difference]: Without dead ends: 229 [2025-04-13 22:15:37,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=220, Invalid=1262, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:15:37,700 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:37,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:37,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-04-13 22:15:37,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 193. [2025-04-13 22:15:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.7083333333333335) internal successors, (520), 192 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call 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:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 520 transitions. [2025-04-13 22:15:37,848 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 520 transitions. Word has length 29 [2025-04-13 22:15:37,848 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:37,848 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 520 transitions. [2025-04-13 22:15:37,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) 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:15:37,848 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 520 transitions. [2025-04-13 22:15:37,848 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:37,848 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:37,848 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:15:37,856 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:15:38,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:38,053 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:15:38,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:38,053 INFO L85 PathProgramCache]: Analyzing trace with hash 653012185, now seen corresponding path program 91 times [2025-04-13 22:15:38,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:38,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973546158] [2025-04-13 22:15:38,053 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:38,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:38,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:15:38,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:38,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:38,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:38,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:38,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973546158] [2025-04-13 22:15:38,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973546158] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:38,561 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141864373] [2025-04-13 22:15:38,561 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:38,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:38,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:38,562 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:15:38,563 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:15:38,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:15:38,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:38,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:38,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:38,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:38,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:38,930 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:38,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 58 treesize of output 34 [2025-04-13 22:15:38,959 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:15:38,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:39,100 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:15:39,100 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 67 treesize of output 71 [2025-04-13 22:15:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:39,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141864373] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:39,113 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:39,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2025-04-13 22:15:39,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075709656] [2025-04-13 22:15:39,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:39,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:15:39,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:39,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:15:39,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:15:39,114 INFO L87 Difference]: Start difference. First operand 193 states and 520 transitions. Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:15:39,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:39,805 INFO L93 Difference]: Finished difference Result 260 states and 666 transitions. [2025-04-13 22:15:39,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:15:39,806 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:15:39,806 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:39,807 INFO L225 Difference]: With dead ends: 260 [2025-04-13 22:15:39,807 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 22:15:39,807 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1140, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:15:39,807 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:39,807 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 22:15:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 193. [2025-04-13 22:15:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 2.7083333333333335) internal successors, (520), 192 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call 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,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 520 transitions. [2025-04-13 22:15:39,957 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 520 transitions. Word has length 29 [2025-04-13 22:15:39,957 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:39,957 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 520 transitions. [2025-04-13 22:15:39,957 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:15:39,957 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 520 transitions. [2025-04-13 22:15:39,957 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:39,957 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:39,958 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:15:39,965 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:15:40,158 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:40,158 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:15:40,158 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash 126200009, now seen corresponding path program 92 times [2025-04-13 22:15:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:40,158 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298831015] [2025-04-13 22:15:40,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:40,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:40,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:40,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:40,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:40,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:40,587 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:40,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:40,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298831015] [2025-04-13 22:15:40,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298831015] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:40,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102120241] [2025-04-13 22:15:40,588 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:40,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:40,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:40,590 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:15:40,590 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:15:40,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:40,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:40,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:40,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:40,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:15:40,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:15:40,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:41,026 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:15:41,027 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 71 treesize of output 88 [2025-04-13 22:15:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:41,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102120241] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:41,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:41,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 25 [2025-04-13 22:15:41,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007626109] [2025-04-13 22:15:41,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:41,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:15:41,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:41,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:15:41,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:15:41,098 INFO L87 Difference]: Start difference. First operand 193 states and 520 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:15:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:41,925 INFO L93 Difference]: Finished difference Result 272 states and 664 transitions. [2025-04-13 22:15:41,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:15:41,925 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 29 [2025-04-13 22:15:41,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:41,926 INFO L225 Difference]: With dead ends: 272 [2025-04-13 22:15:41,926 INFO L226 Difference]: Without dead ends: 261 [2025-04-13 22:15:41,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:15:41,927 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:41,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-04-13 22:15:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 203. [2025-04-13 22:15:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.727722772277228) internal successors, (551), 202 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call 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:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 551 transitions. [2025-04-13 22:15:42,088 INFO L79 Accepts]: Start accepts. Automaton has 203 states and 551 transitions. Word has length 29 [2025-04-13 22:15:42,089 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:42,089 INFO L485 AbstractCegarLoop]: Abstraction has 203 states and 551 transitions. [2025-04-13 22:15:42,089 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:15:42,089 INFO L278 IsEmpty]: Start isEmpty. Operand 203 states and 551 transitions. [2025-04-13 22:15:42,089 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:42,089 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:42,089 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:15:42,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2025-04-13 22:15:42,289 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,SelfDestructingSolverStorable100 [2025-04-13 22:15:42,290 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:15:42,290 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:42,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1386187647, now seen corresponding path program 93 times [2025-04-13 22:15:42,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:42,290 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041447545] [2025-04-13 22:15:42,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:42,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:42,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:42,315 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:15:42,315 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:42,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:42,640 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:15:42,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:42,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041447545] [2025-04-13 22:15:42,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041447545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:42,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52569969] [2025-04-13 22:15:42,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:42,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:42,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:42,642 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:15:42,643 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:15:42,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:42,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:15:42,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:42,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:42,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:15:42,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:43,011 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:15:43,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:43,096 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:43,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 73 treesize of output 94 [2025-04-13 22:15:43,143 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:15:43,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52569969] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:43,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:43,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 22:15:43,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825277572] [2025-04-13 22:15:43,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:43,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:15:43,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:43,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:15:43,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:15:43,144 INFO L87 Difference]: Start difference. First operand 203 states and 551 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 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:15:43,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:43,660 INFO L93 Difference]: Finished difference Result 226 states and 593 transitions. [2025-04-13 22:15:43,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:15:43,661 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 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:15:43,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:43,662 INFO L225 Difference]: With dead ends: 226 [2025-04-13 22:15:43,662 INFO L226 Difference]: Without dead ends: 213 [2025-04-13 22:15:43,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=802, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:15:43,662 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:43,662 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:15:43,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-04-13 22:15:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 205. [2025-04-13 22:15:43,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.7254901960784315) internal successors, (556), 204 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call 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,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 556 transitions. [2025-04-13 22:15:43,822 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 556 transitions. Word has length 29 [2025-04-13 22:15:43,822 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:43,823 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 556 transitions. [2025-04-13 22:15:43,823 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 23 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:15:43,823 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 556 transitions. [2025-04-13 22:15:43,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:43,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:43,823 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:15:43,830 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:15:44,023 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,SelfDestructingSolverStorable101 [2025-04-13 22:15:44,024 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:15:44,024 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1646960311, now seen corresponding path program 94 times [2025-04-13 22:15:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:44,024 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60436525] [2025-04-13 22:15:44,024 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:44,033 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:44,050 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:44,050 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:44,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:44,512 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:15:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:44,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60436525] [2025-04-13 22:15:44,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60436525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:44,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871171356] [2025-04-13 22:15:44,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:44,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:44,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:44,514 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:15:44,515 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:15:44,751 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:44,776 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:44,776 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:44,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:44,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:44,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:44,875 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:44,875 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 58 treesize of output 34 [2025-04-13 22:15:44,912 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:15:44,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:45,004 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:15:45,004 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 71 treesize of output 88 [2025-04-13 22:15:45,075 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:15:45,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871171356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:45,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:45,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:15:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002635407] [2025-04-13 22:15:45,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:45,076 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:45,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:45,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:45,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:45,076 INFO L87 Difference]: Start difference. First operand 205 states and 556 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:45,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:45,936 INFO L93 Difference]: Finished difference Result 284 states and 717 transitions. [2025-04-13 22:15:45,937 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:15:45,937 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:15:45,937 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:45,938 INFO L225 Difference]: With dead ends: 284 [2025-04-13 22:15:45,938 INFO L226 Difference]: Without dead ends: 275 [2025-04-13 22:15:45,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=1732, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:15:45,938 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:45,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:45,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-13 22:15:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 203. [2025-04-13 22:15:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.707920792079208) internal successors, (547), 202 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call 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:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 547 transitions. [2025-04-13 22:15:46,101 INFO L79 Accepts]: Start accepts. Automaton has 203 states and 547 transitions. Word has length 29 [2025-04-13 22:15:46,101 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:46,101 INFO L485 AbstractCegarLoop]: Abstraction has 203 states and 547 transitions. [2025-04-13 22:15:46,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:46,101 INFO L278 IsEmpty]: Start isEmpty. Operand 203 states and 547 transitions. [2025-04-13 22:15:46,101 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:46,102 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:46,102 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:15:46,109 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:15:46,302 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,SelfDestructingSolverStorable102 [2025-04-13 22:15:46,302 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:15:46,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:46,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2131630050, now seen corresponding path program 95 times [2025-04-13 22:15:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:46,303 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824015646] [2025-04-13 22:15:46,303 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:46,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:46,312 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:46,327 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:46,327 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:46,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:46,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824015646] [2025-04-13 22:15:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824015646] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:46,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121178079] [2025-04-13 22:15:46,681 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:15:46,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:46,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:46,683 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:15:46,683 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:15:46,932 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:47,097 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:47,097 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:15:47,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:47,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:15:47,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:47,276 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:15:47,276 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 29 treesize of output 9 [2025-04-13 22:15:47,291 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:47,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:47,496 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:47,496 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:15:47,523 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:47,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121178079] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:47,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:47,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 29 [2025-04-13 22:15:47,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20776939] [2025-04-13 22:15:47,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:47,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:47,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:47,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:47,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:47,524 INFO L87 Difference]: Start difference. First operand 203 states and 547 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:15:48,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:48,336 INFO L93 Difference]: Finished difference Result 244 states and 640 transitions. [2025-04-13 22:15:48,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:15:48,336 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:15:48,337 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:48,337 INFO L225 Difference]: With dead ends: 244 [2025-04-13 22:15:48,337 INFO L226 Difference]: Without dead ends: 236 [2025-04-13 22:15:48,337 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=1741, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:15:48,338 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:48,338 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-04-13 22:15:48,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 203. [2025-04-13 22:15:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 202 states have (on average 2.707920792079208) internal successors, (547), 202 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call 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,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 547 transitions. [2025-04-13 22:15:48,508 INFO L79 Accepts]: Start accepts. Automaton has 203 states and 547 transitions. Word has length 29 [2025-04-13 22:15:48,508 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:48,508 INFO L485 AbstractCegarLoop]: Abstraction has 203 states and 547 transitions. [2025-04-13 22:15:48,508 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:15:48,508 INFO L278 IsEmpty]: Start isEmpty. Operand 203 states and 547 transitions. [2025-04-13 22:15:48,509 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:48,509 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:48,509 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:15:48,520 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:15:48,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 22:15:48,709 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:15:48,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash 137498283, now seen corresponding path program 96 times [2025-04-13 22:15:48,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:48,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415131295] [2025-04-13 22:15:48,710 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:48,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:48,719 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:48,734 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:48,734 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:48,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:49,060 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:15:49,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:49,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415131295] [2025-04-13 22:15:49,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415131295] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:49,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327980113] [2025-04-13 22:15:49,061 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:15:49,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:49,063 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:15:49,063 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:15:49,314 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:49,347 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:49,347 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:15:49,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:49,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:15:49,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:49,486 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:49,486 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 65 treesize of output 41 [2025-04-13 22:15:49,509 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:15:49,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:49,608 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:15:49,608 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 44 treesize of output 77 [2025-04-13 22:15:49,688 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:15:49,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327980113] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:49,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:49,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2025-04-13 22:15:49,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335014201] [2025-04-13 22:15:49,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:49,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:15:49,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:49,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:15:49,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=540, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:15:49,689 INFO L87 Difference]: Start difference. First operand 203 states and 547 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) 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:15:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:50,607 INFO L93 Difference]: Finished difference Result 309 states and 792 transitions. [2025-04-13 22:15:50,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:15:50,607 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) 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 29 [2025-04-13 22:15:50,607 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:50,608 INFO L225 Difference]: With dead ends: 309 [2025-04-13 22:15:50,608 INFO L226 Difference]: Without dead ends: 298 [2025-04-13 22:15:50,609 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=1113, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:15:50,609 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:50,609 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-04-13 22:15:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 211. [2025-04-13 22:15:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.7476190476190476) internal successors, (577), 210 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call 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:50,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 577 transitions. [2025-04-13 22:15:50,794 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 577 transitions. Word has length 29 [2025-04-13 22:15:50,794 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:50,794 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 577 transitions. [2025-04-13 22:15:50,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) 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:15:50,794 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 577 transitions. [2025-04-13 22:15:50,794 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:50,794 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:50,794 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:15:50,802 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:15:50,994 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,SelfDestructingSolverStorable104 [2025-04-13 22:15:50,995 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:15:50,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:50,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1198166341, now seen corresponding path program 97 times [2025-04-13 22:15:50,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:50,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308524054] [2025-04-13 22:15:50,995 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:51,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:15:51,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:51,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:51,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:15:51,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:51,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308524054] [2025-04-13 22:15:51,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308524054] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:51,529 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354818895] [2025-04-13 22:15:51,529 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:15:51,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:51,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:51,531 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:15:51,531 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:15:51,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:15:51,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:51,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:15:51,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:51,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:15:51,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:51,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:52,004 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:52,004 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 73 treesize of output 94 [2025-04-13 22:15:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:15:52,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354818895] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:52,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:52,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:15:52,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140828709] [2025-04-13 22:15:52,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:52,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:52,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:52,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:52,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:52,044 INFO L87 Difference]: Start difference. First operand 211 states and 577 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:15:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:52,690 INFO L93 Difference]: Finished difference Result 239 states and 635 transitions. [2025-04-13 22:15:52,691 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:15:52,691 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:15:52,691 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:52,692 INFO L225 Difference]: With dead ends: 239 [2025-04-13 22:15:52,692 INFO L226 Difference]: Without dead ends: 228 [2025-04-13 22:15:52,692 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:15:52,692 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:52,692 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-13 22:15:52,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 213. [2025-04-13 22:15:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.7452830188679247) internal successors, (582), 212 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call 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,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 582 transitions. [2025-04-13 22:15:52,870 INFO L79 Accepts]: Start accepts. Automaton has 213 states and 582 transitions. Word has length 29 [2025-04-13 22:15:52,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:52,870 INFO L485 AbstractCegarLoop]: Abstraction has 213 states and 582 transitions. [2025-04-13 22:15:52,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:15:52,870 INFO L278 IsEmpty]: Start isEmpty. Operand 213 states and 582 transitions. [2025-04-13 22:15:52,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:52,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:52,870 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:15:52,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2025-04-13 22:15:53,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:53,071 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:15:53,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:53,071 INFO L85 PathProgramCache]: Analyzing trace with hash 167974476, now seen corresponding path program 98 times [2025-04-13 22:15:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:53,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691351417] [2025-04-13 22:15:53,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:53,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:53,092 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:53,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:53,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:53,571 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:15:53,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:53,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691351417] [2025-04-13 22:15:53,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691351417] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:53,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327194365] [2025-04-13 22:15:53,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:15:53,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:53,576 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:15:53,577 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:15:53,823 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:53,848 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:53,848 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:15:53,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:53,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-13 22:15:53,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:54,005 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:54,005 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 46 treesize of output 30 [2025-04-13 22:15:54,073 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:15:54,073 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:54,191 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:15:54,191 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 71 treesize of output 88 [2025-04-13 22:15:54,294 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:15:54,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327194365] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:54,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:54,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2025-04-13 22:15:54,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398124009] [2025-04-13 22:15:54,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:54,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:15:54,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:54,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:15:54,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:15:54,295 INFO L87 Difference]: Start difference. First operand 213 states and 582 transitions. Second operand has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:55,409 INFO L93 Difference]: Finished difference Result 290 states and 767 transitions. [2025-04-13 22:15:55,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:15:55,410 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:15:55,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:55,410 INFO L225 Difference]: With dead ends: 290 [2025-04-13 22:15:55,411 INFO L226 Difference]: Without dead ends: 274 [2025-04-13 22:15:55,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=336, Invalid=2114, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:15:55,411 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:55,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:15:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-13 22:15:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 219. [2025-04-13 22:15:55,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.7477064220183487) internal successors, (599), 218 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call 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,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 599 transitions. [2025-04-13 22:15:55,593 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 599 transitions. Word has length 29 [2025-04-13 22:15:55,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:55,593 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 599 transitions. [2025-04-13 22:15:55,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,593 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 599 transitions. [2025-04-13 22:15:55,594 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:55,594 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:55,594 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:15:55,601 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:15:55,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:55,794 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:15:55,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:55,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2142928324, now seen corresponding path program 99 times [2025-04-13 22:15:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:55,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154508311] [2025-04-13 22:15:55,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:55,804 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:55,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:15:55,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:55,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:56,128 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:15:56,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:56,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154508311] [2025-04-13 22:15:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154508311] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:56,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699350841] [2025-04-13 22:15:56,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:15:56,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:56,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:56,131 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:15:56,131 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:15:56,381 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:15:56,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:15:56,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:15:56,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:56,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:15:56,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:56,564 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:15:56,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:56,666 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:15:56,667 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:15:56,728 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:15:56,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699350841] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:56,728 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:56,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:15:56,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082974893] [2025-04-13 22:15:56,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:56,728 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:15:56,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:56,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:15:56,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:15:56,729 INFO L87 Difference]: Start difference. First operand 219 states and 599 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:15:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:57,357 INFO L93 Difference]: Finished difference Result 264 states and 704 transitions. [2025-04-13 22:15:57,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:15:57,357 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:15:57,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:57,358 INFO L225 Difference]: With dead ends: 264 [2025-04-13 22:15:57,358 INFO L226 Difference]: Without dead ends: 256 [2025-04-13 22:15:57,358 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:15:57,358 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:57,358 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:15:57,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2025-04-13 22:15:57,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2025-04-13 22:15:57,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.7477064220183487) internal successors, (599), 218 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call 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:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 599 transitions. [2025-04-13 22:15:57,544 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 599 transitions. Word has length 29 [2025-04-13 22:15:57,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:15:57,544 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 599 transitions. [2025-04-13 22:15:57,544 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:15:57,544 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 599 transitions. [2025-04-13 22:15:57,544 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:15:57,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:15:57,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:15:57,552 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:15:57,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2025-04-13 22:15:57,745 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:15:57,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:15:57,745 INFO L85 PathProgramCache]: Analyzing trace with hash 79405833, now seen corresponding path program 100 times [2025-04-13 22:15:57,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:15:57,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606431176] [2025-04-13 22:15:57,746 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:57,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:15:57,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:57,766 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:57,766 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:57,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:58,230 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:15:58,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:15:58,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606431176] [2025-04-13 22:15:58,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606431176] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:15:58,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238076694] [2025-04-13 22:15:58,231 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:15:58,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:15:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:15:58,232 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:15:58,233 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:15:58,491 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:15:58,516 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:15:58,516 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:15:58,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:15:58,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:15:58,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:15:58,593 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:15:58,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 58 treesize of output 34 [2025-04-13 22:15:58,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:15:58,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:15:58,720 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:15:58,720 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 44 treesize of output 77 [2025-04-13 22:15:58,778 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:15:58,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238076694] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:15:58,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:15:58,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:15:58,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772490097] [2025-04-13 22:15:58,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:15:58,778 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:15:58,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:15:58,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:15:58,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:15:58,779 INFO L87 Difference]: Start difference. First operand 219 states and 599 transitions. Second operand has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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:15:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:15:59,853 INFO L93 Difference]: Finished difference Result 321 states and 825 transitions. [2025-04-13 22:15:59,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:15:59,853 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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 29 [2025-04-13 22:15:59,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:15:59,854 INFO L225 Difference]: With dead ends: 321 [2025-04-13 22:15:59,854 INFO L226 Difference]: Without dead ends: 314 [2025-04-13 22:15:59,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:15:59,854 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:15:59,854 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:15:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-04-13 22:16:00,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 215. [2025-04-13 22:16:00,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.7429906542056073) internal successors, (587), 214 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call 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,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 587 transitions. [2025-04-13 22:16:00,042 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 587 transitions. Word has length 29 [2025-04-13 22:16:00,042 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:00,042 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 587 transitions. [2025-04-13 22:16:00,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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:16:00,042 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 587 transitions. [2025-04-13 22:16:00,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:00,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:00,042 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:00,051 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:16:00,243 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,SelfDestructingSolverStorable108 [2025-04-13 22:16:00,243 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:16:00,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -519582719, now seen corresponding path program 101 times [2025-04-13 22:16:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:00,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54073172] [2025-04-13 22:16:00,243 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:00,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:00,252 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:00,268 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:00,268 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:00,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:00,723 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:16:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:00,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54073172] [2025-04-13 22:16:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54073172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:00,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106332037] [2025-04-13 22:16:00,723 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:00,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:00,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:00,725 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:16:00,725 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:16:00,976 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:01,070 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:01,070 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:01,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:01,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:16:01,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:01,191 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:01,192 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 52 treesize of output 34 [2025-04-13 22:16:01,232 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:16:01,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:01,386 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:16:01,386 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 73 treesize of output 94 [2025-04-13 22:16:01,442 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:16:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106332037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:01,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:01,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2025-04-13 22:16:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392676468] [2025-04-13 22:16:01,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:01,443 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:16:01,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:01,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:16:01,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:16:01,443 INFO L87 Difference]: Start difference. First operand 215 states and 587 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) 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:16:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:02,203 INFO L93 Difference]: Finished difference Result 261 states and 690 transitions. [2025-04-13 22:16:02,204 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:16:02,204 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) 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 29 [2025-04-13 22:16:02,204 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:02,205 INFO L225 Difference]: With dead ends: 261 [2025-04-13 22:16:02,205 INFO L226 Difference]: Without dead ends: 246 [2025-04-13 22:16:02,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=1040, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:16:02,205 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:02,205 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:02,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-04-13 22:16:02,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 219. [2025-04-13 22:16:02,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.756880733944954) internal successors, (601), 218 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call 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:02,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 601 transitions. [2025-04-13 22:16:02,410 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 601 transitions. Word has length 29 [2025-04-13 22:16:02,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:02,410 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 601 transitions. [2025-04-13 22:16:02,410 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) 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:16:02,410 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 601 transitions. [2025-04-13 22:16:02,410 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:02,410 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:02,410 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:02,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:02,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:02,611 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:16:02,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:02,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1800430729, now seen corresponding path program 102 times [2025-04-13 22:16:02,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:02,611 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173678471] [2025-04-13 22:16:02,611 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:02,620 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:02,638 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:02,638 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:02,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:02,970 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:16:02,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:02,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173678471] [2025-04-13 22:16:02,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173678471] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:02,970 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121300650] [2025-04-13 22:16:02,970 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:02,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:02,972 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:16:02,973 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:16:03,229 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:03,258 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:03,259 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:03,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:03,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:16:03,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:03,356 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:16:03,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:03,449 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:03,449 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 44 treesize of output 77 [2025-04-13 22:16:03,505 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:16:03,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121300650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:03,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:03,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 22:16:03,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006952020] [2025-04-13 22:16:03,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:03,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:16:03,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:03,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:16:03,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:16:03,506 INFO L87 Difference]: Start difference. First operand 219 states and 601 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:16:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:04,223 INFO L93 Difference]: Finished difference Result 282 states and 745 transitions. [2025-04-13 22:16:04,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:16:04,223 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:16:04,223 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:04,224 INFO L225 Difference]: With dead ends: 282 [2025-04-13 22:16:04,224 INFO L226 Difference]: Without dead ends: 275 [2025-04-13 22:16:04,224 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:16:04,225 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:04,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:16:04,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-13 22:16:04,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 215. [2025-04-13 22:16:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.7336448598130842) internal successors, (585), 214 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call 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:04,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 585 transitions. [2025-04-13 22:16:04,409 INFO L79 Accepts]: Start accepts. Automaton has 215 states and 585 transitions. Word has length 29 [2025-04-13 22:16:04,409 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:04,409 INFO L485 AbstractCegarLoop]: Abstraction has 215 states and 585 transitions. [2025-04-13 22:16:04,409 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:16:04,409 INFO L278 IsEmpty]: Start isEmpty. Operand 215 states and 585 transitions. [2025-04-13 22:16:04,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:04,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:04,409 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:04,417 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:16:04,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:04,610 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:16:04,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:04,610 INFO L85 PathProgramCache]: Analyzing trace with hash -574993979, now seen corresponding path program 103 times [2025-04-13 22:16:04,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:04,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761517409] [2025-04-13 22:16:04,610 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:04,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:04,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:16:04,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:04,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:04,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:05,129 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:16:05,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:05,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761517409] [2025-04-13 22:16:05,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761517409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:05,129 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689317713] [2025-04-13 22:16:05,129 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:05,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:05,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:05,131 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:16:05,132 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:16:05,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:16:05,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:05,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:05,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:05,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:16:05,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:05,514 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:05,515 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 58 treesize of output 34 [2025-04-13 22:16:05,545 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:16:05,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:05,666 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:16:05,666 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 73 treesize of output 94 [2025-04-13 22:16:05,715 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:16:05,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689317713] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:05,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:05,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2025-04-13 22:16:05,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785974611] [2025-04-13 22:16:05,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:05,715 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:16:05,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:05,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:16:05,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:16:05,716 INFO L87 Difference]: Start difference. First operand 215 states and 585 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:16:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:06,429 INFO L93 Difference]: Finished difference Result 240 states and 636 transitions. [2025-04-13 22:16:06,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:16:06,429 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:16:06,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:06,430 INFO L225 Difference]: With dead ends: 240 [2025-04-13 22:16:06,430 INFO L226 Difference]: Without dead ends: 233 [2025-04-13 22:16:06,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:16:06,430 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:06,430 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:16:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-04-13 22:16:06,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 207. [2025-04-13 22:16:06,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.7233009708737863) internal successors, (561), 206 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call 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:06,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 561 transitions. [2025-04-13 22:16:06,610 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 561 transitions. Word has length 29 [2025-04-13 22:16:06,610 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:06,610 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 561 transitions. [2025-04-13 22:16:06,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:16:06,610 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 561 transitions. [2025-04-13 22:16:06,610 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:06,610 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:06,610 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:06,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2025-04-13 22:16:06,811 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,SelfDestructingSolverStorable111 [2025-04-13 22:16:06,811 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:16:06,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash 2120075761, now seen corresponding path program 104 times [2025-04-13 22:16:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:06,811 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098729879] [2025-04-13 22:16:06,811 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:06,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:06,820 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:06,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:06,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:06,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:07,256 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:16:07,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:07,256 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098729879] [2025-04-13 22:16:07,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098729879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:07,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735560379] [2025-04-13 22:16:07,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:07,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:07,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:07,258 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:16:07,259 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:16:07,523 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:07,551 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:07,551 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:07,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:07,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:16:07,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:07,654 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:16:07,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:07,732 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:07,732 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 71 treesize of output 88 [2025-04-13 22:16:07,802 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:16:07,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735560379] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:07,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:07,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 25 [2025-04-13 22:16:07,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986249177] [2025-04-13 22:16:07,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:07,803 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:16:07,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:07,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:16:07,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:16:07,803 INFO L87 Difference]: Start difference. First operand 207 states and 561 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:16:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:08,654 INFO L93 Difference]: Finished difference Result 276 states and 700 transitions. [2025-04-13 22:16:08,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:16:08,654 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 29 [2025-04-13 22:16:08,654 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:08,655 INFO L225 Difference]: With dead ends: 276 [2025-04-13 22:16:08,655 INFO L226 Difference]: Without dead ends: 263 [2025-04-13 22:16:08,655 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1519, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:16:08,655 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:08,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:16:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-04-13 22:16:08,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 219. [2025-04-13 22:16:08,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.756880733944954) internal successors, (601), 218 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call 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,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 601 transitions. [2025-04-13 22:16:08,843 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 601 transitions. Word has length 29 [2025-04-13 22:16:08,843 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:08,843 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 601 transitions. [2025-04-13 22:16:08,843 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:16:08,843 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 601 transitions. [2025-04-13 22:16:08,844 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:08,844 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:08,844 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:08,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2025-04-13 22:16:09,044 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,SelfDestructingSolverStorable112 [2025-04-13 22:16:09,044 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:16:09,044 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:09,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1035941153, now seen corresponding path program 105 times [2025-04-13 22:16:09,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:09,045 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234185781] [2025-04-13 22:16:09,045 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:09,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:09,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:09,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 22:16:09,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:16:09,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:09,387 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:09,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:09,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234185781] [2025-04-13 22:16:09,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234185781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:09,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374359461] [2025-04-13 22:16:09,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:09,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:09,389 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:16:09,389 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:16:09,657 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:09,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 22:16:09,680 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:16:09,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:09,681 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:16:09,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:09,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:09,921 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:09,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 71 treesize of output 88 [2025-04-13 22:16:09,994 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:09,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374359461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:09,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:09,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2025-04-13 22:16:09,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757315242] [2025-04-13 22:16:09,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:09,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:16:09,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:09,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:16:09,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:16:09,995 INFO L87 Difference]: Start difference. First operand 219 states and 601 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:10,974 INFO L93 Difference]: Finished difference Result 285 states and 713 transitions. [2025-04-13 22:16:10,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:16:10,974 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:10,974 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:10,975 INFO L225 Difference]: With dead ends: 285 [2025-04-13 22:16:10,975 INFO L226 Difference]: Without dead ends: 272 [2025-04-13 22:16:10,975 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1797, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:16:10,976 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:10,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:10,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-04-13 22:16:11,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 219. [2025-04-13 22:16:11,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.738532110091743) internal successors, (597), 218 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call 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:11,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 597 transitions. [2025-04-13 22:16:11,174 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 597 transitions. Word has length 29 [2025-04-13 22:16:11,174 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:11,174 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 597 transitions. [2025-04-13 22:16:11,174 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:11,175 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 597 transitions. [2025-04-13 22:16:11,175 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:11,175 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:11,175 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:11,182 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:16:11,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable113 [2025-04-13 22:16:11,375 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:16:11,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1230129552, now seen corresponding path program 106 times [2025-04-13 22:16:11,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:11,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684232969] [2025-04-13 22:16:11,376 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:11,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:11,385 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:11,397 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:11,397 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:11,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:11,842 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:16:11,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:11,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684232969] [2025-04-13 22:16:11,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684232969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:11,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30139438] [2025-04-13 22:16:11,842 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:11,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:11,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:11,844 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:16:11,845 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:16:12,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:12,133 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:12,133 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:12,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:12,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:16:12,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:12,219 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:16:12,219 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 33 treesize of output 9 [2025-04-13 22:16:12,221 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:16:12,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:12,310 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:12,311 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 44 treesize of output 77 [2025-04-13 22:16:12,367 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:16:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30139438] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:12,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:12,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:16:12,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293910660] [2025-04-13 22:16:12,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:12,367 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:16:12,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:12,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:16:12,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:12,368 INFO L87 Difference]: Start difference. First operand 219 states and 597 transitions. Second operand has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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:13,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:13,335 INFO L93 Difference]: Finished difference Result 291 states and 756 transitions. [2025-04-13 22:16:13,335 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:16:13,335 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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:13,335 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:13,336 INFO L225 Difference]: With dead ends: 291 [2025-04-13 22:16:13,336 INFO L226 Difference]: Without dead ends: 283 [2025-04-13 22:16:13,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=1917, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:16:13,336 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 947 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:13,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 947 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:13,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-04-13 22:16:13,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 221. [2025-04-13 22:16:13,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.7545454545454544) internal successors, (606), 220 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call 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,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 606 transitions. [2025-04-13 22:16:13,533 INFO L79 Accepts]: Start accepts. Automaton has 221 states and 606 transitions. Word has length 29 [2025-04-13 22:16:13,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:13,533 INFO L485 AbstractCegarLoop]: Abstraction has 221 states and 606 transitions. [2025-04-13 22:16:13,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 29 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:13,534 INFO L278 IsEmpty]: Start isEmpty. Operand 221 states and 606 transitions. [2025-04-13 22:16:13,534 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:13,534 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:13,534 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:13,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2025-04-13 22:16:13,734 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable114,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:13,735 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:16:13,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash -91179170, now seen corresponding path program 107 times [2025-04-13 22:16:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:13,735 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948623936] [2025-04-13 22:16:13,735 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:13,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:13,760 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:13,760 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:13,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:14,136 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:16:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:14,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948623936] [2025-04-13 22:16:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948623936] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:14,136 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452872748] [2025-04-13 22:16:14,136 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:14,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:14,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:14,138 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:16:14,139 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:16:14,399 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:14,486 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:14,486 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:14,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:14,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:16:14,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:16:14,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:14,725 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:14,725 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 44 treesize of output 77 [2025-04-13 22:16:14,785 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:16:14,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452872748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:14,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:14,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-04-13 22:16:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376634460] [2025-04-13 22:16:14,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:14,785 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:16:14,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:14,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:16:14,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:16:14,786 INFO L87 Difference]: Start difference. First operand 221 states and 606 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:15,739 INFO L93 Difference]: Finished difference Result 301 states and 788 transitions. [2025-04-13 22:16:15,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:16:15,739 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:15,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:15,740 INFO L225 Difference]: With dead ends: 301 [2025-04-13 22:16:15,740 INFO L226 Difference]: Without dead ends: 293 [2025-04-13 22:16:15,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=1383, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:16:15,741 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 64 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:15,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 0 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-04-13 22:16:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 217. [2025-04-13 22:16:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.759259259259259) internal successors, (596), 216 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call 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:15,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 596 transitions. [2025-04-13 22:16:15,929 INFO L79 Accepts]: Start accepts. Automaton has 217 states and 596 transitions. Word has length 29 [2025-04-13 22:16:15,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:15,929 INFO L485 AbstractCegarLoop]: Abstraction has 217 states and 596 transitions. [2025-04-13 22:16:15,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:15,929 INFO L278 IsEmpty]: Start isEmpty. Operand 217 states and 596 transitions. [2025-04-13 22:16:15,930 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:15,930 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:15,930 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:15,938 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:16:16,130 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,SelfDestructingSolverStorable115 [2025-04-13 22:16:16,130 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:16:16,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:16,131 INFO L85 PathProgramCache]: Analyzing trace with hash 402326701, now seen corresponding path program 108 times [2025-04-13 22:16:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:16,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984059292] [2025-04-13 22:16:16,131 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:16,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:16,140 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:16,153 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:16,153 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:16,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:16,510 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:16:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:16,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984059292] [2025-04-13 22:16:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984059292] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:16,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261992015] [2025-04-13 22:16:16,510 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:16,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:16,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:16,512 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:16:16,513 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:16:16,786 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:16,818 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:16,818 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:16,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:16,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:16:16,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:17,001 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:17,001 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 65 treesize of output 41 [2025-04-13 22:16:17,023 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:16:17,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:17,106 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:17,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 71 treesize of output 88 [2025-04-13 22:16:17,185 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:16:17,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261992015] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:17,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:17,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:16:17,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069957603] [2025-04-13 22:16:17,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:17,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:16:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:17,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:16:17,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:16:17,186 INFO L87 Difference]: Start difference. First operand 217 states and 596 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:16:18,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:18,253 INFO L93 Difference]: Finished difference Result 308 states and 783 transitions. [2025-04-13 22:16:18,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:16:18,253 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:16:18,253 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:18,254 INFO L225 Difference]: With dead ends: 308 [2025-04-13 22:16:18,254 INFO L226 Difference]: Without dead ends: 297 [2025-04-13 22:16:18,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=247, Invalid=1475, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:16:18,255 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:18,255 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-04-13 22:16:18,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 221. [2025-04-13 22:16:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.7818181818181817) internal successors, (612), 220 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call 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,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 612 transitions. [2025-04-13 22:16:18,451 INFO L79 Accepts]: Start accepts. Automaton has 221 states and 612 transitions. Word has length 29 [2025-04-13 22:16:18,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:18,451 INFO L485 AbstractCegarLoop]: Abstraction has 221 states and 612 transitions. [2025-04-13 22:16:18,451 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:16:18,451 INFO L278 IsEmpty]: Start isEmpty. Operand 221 states and 612 transitions. [2025-04-13 22:16:18,451 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:18,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:18,451 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:18,458 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:16:18,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable116 [2025-04-13 22:16:18,652 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:16:18,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:18,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1541277083, now seen corresponding path program 109 times [2025-04-13 22:16:18,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:18,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537402067] [2025-04-13 22:16:18,652 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:18,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:16:18,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:18,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:18,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:16:19,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:19,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537402067] [2025-04-13 22:16:19,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537402067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:19,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784692259] [2025-04-13 22:16:19,148 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:19,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:19,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:19,150 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:16:19,151 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:16:19,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:16:19,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:19,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:19,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:19,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:16:19,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:19,513 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:19,513 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 58 treesize of output 34 [2025-04-13 22:16:19,547 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:16:19,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:19,637 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:19,637 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 71 treesize of output 88 [2025-04-13 22:16:19,688 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:16:19,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784692259] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:19,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:19,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:16:19,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263646404] [2025-04-13 22:16:19,688 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:19,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:16:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:19,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:16:19,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:19,689 INFO L87 Difference]: Start difference. First operand 221 states and 612 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:16:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:21,037 INFO L93 Difference]: Finished difference Result 342 states and 860 transitions. [2025-04-13 22:16:21,037 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:16:21,037 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:16:21,037 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:21,038 INFO L225 Difference]: With dead ends: 342 [2025-04-13 22:16:21,038 INFO L226 Difference]: Without dead ends: 325 [2025-04-13 22:16:21,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=335, Invalid=2527, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:16:21,039 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:21,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-04-13 22:16:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 223. [2025-04-13 22:16:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.77027027027027) internal successors, (615), 222 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call 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:21,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 615 transitions. [2025-04-13 22:16:21,231 INFO L79 Accepts]: Start accepts. Automaton has 223 states and 615 transitions. Word has length 29 [2025-04-13 22:16:21,231 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:21,231 INFO L485 AbstractCegarLoop]: Abstraction has 223 states and 615 transitions. [2025-04-13 22:16:21,231 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:16:21,231 INFO L278 IsEmpty]: Start isEmpty. Operand 223 states and 615 transitions. [2025-04-13 22:16:21,231 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:21,231 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:21,231 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:21,239 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:16:21,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable117 [2025-04-13 22:16:21,432 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:16:21,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 432802894, now seen corresponding path program 110 times [2025-04-13 22:16:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:21,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477808837] [2025-04-13 22:16:21,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:21,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:21,457 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:21,458 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:21,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:16:22,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:22,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477808837] [2025-04-13 22:16:22,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477808837] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:22,040 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029202702] [2025-04-13 22:16:22,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:22,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:22,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:22,042 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:16:22,042 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:16:22,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:22,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:22,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:22,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:22,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:16:22,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:22,488 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:22,489 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 65 treesize of output 41 [2025-04-13 22:16:22,521 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:16:22,521 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:22,616 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:22,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 44 treesize of output 77 [2025-04-13 22:16:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:22,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029202702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:22,708 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:22,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 9] total 33 [2025-04-13 22:16:22,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218067229] [2025-04-13 22:16:22,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:22,709 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:16:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:22,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:16:22,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=929, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:16:22,709 INFO L87 Difference]: Start difference. First operand 223 states and 615 transitions. Second operand has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 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:24,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:24,065 INFO L93 Difference]: Finished difference Result 358 states and 896 transitions. [2025-04-13 22:16:24,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:16:24,065 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 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 29 [2025-04-13 22:16:24,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:24,066 INFO L225 Difference]: With dead ends: 358 [2025-04-13 22:16:24,066 INFO L226 Difference]: Without dead ends: 350 [2025-04-13 22:16:24,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=374, Invalid=2706, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:16:24,066 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 147 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:24,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 0 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-04-13 22:16:24,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 223. [2025-04-13 22:16:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.77027027027027) internal successors, (615), 222 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call 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,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 615 transitions. [2025-04-13 22:16:24,258 INFO L79 Accepts]: Start accepts. Automaton has 223 states and 615 transitions. Word has length 29 [2025-04-13 22:16:24,258 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:24,258 INFO L485 AbstractCegarLoop]: Abstraction has 223 states and 615 transitions. [2025-04-13 22:16:24,258 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 33 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:24,258 INFO L278 IsEmpty]: Start isEmpty. Operand 223 states and 615 transitions. [2025-04-13 22:16:24,259 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:24,259 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:24,259 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:24,266 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:16:24,459 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,SelfDestructingSolverStorable118 [2025-04-13 22:16:24,459 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:16:24,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1571753276, now seen corresponding path program 111 times [2025-04-13 22:16:24,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:24,460 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936681923] [2025-04-13 22:16:24,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:24,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:24,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:24,483 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:16:24,483 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:16:24,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:24,875 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:16:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:24,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936681923] [2025-04-13 22:16:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936681923] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:24,875 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77989871] [2025-04-13 22:16:24,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:24,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:24,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:24,877 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:16:24,878 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:16:25,147 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:25,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:16:25,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:16:25,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:25,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:16:25,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:25,294 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:25,294 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 65 treesize of output 41 [2025-04-13 22:16:25,341 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:16:25,341 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:25,456 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:25,456 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 44 treesize of output 77 [2025-04-13 22:16:25,523 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:16:25,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77989871] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:25,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:25,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 29 [2025-04-13 22:16:25,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533491189] [2025-04-13 22:16:25,523 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:25,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:16:25,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:25,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:16:25,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:25,524 INFO L87 Difference]: Start difference. First operand 223 states and 615 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:16:26,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:26,893 INFO L93 Difference]: Finished difference Result 341 states and 878 transitions. [2025-04-13 22:16:26,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:16:26,894 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:16:26,894 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:26,894 INFO L225 Difference]: With dead ends: 341 [2025-04-13 22:16:26,894 INFO L226 Difference]: Without dead ends: 329 [2025-04-13 22:16:26,895 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 691 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=365, Invalid=2497, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:16:26,895 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:26,895 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-04-13 22:16:27,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 229. [2025-04-13 22:16:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.7719298245614037) internal successors, (632), 228 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call 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:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 632 transitions. [2025-04-13 22:16:27,093 INFO L79 Accepts]: Start accepts. Automaton has 229 states and 632 transitions. Word has length 29 [2025-04-13 22:16:27,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:27,093 INFO L485 AbstractCegarLoop]: Abstraction has 229 states and 632 transitions. [2025-04-13 22:16:27,093 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:16:27,093 INFO L278 IsEmpty]: Start isEmpty. Operand 229 states and 632 transitions. [2025-04-13 22:16:27,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:27,093 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:27,093 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:27,101 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:16:27,293 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:27,294 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:16:27,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:27,294 INFO L85 PathProgramCache]: Analyzing trace with hash 319299184, now seen corresponding path program 112 times [2025-04-13 22:16:27,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:27,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949401189] [2025-04-13 22:16:27,294 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:27,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:27,303 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:27,314 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:27,314 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:27,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:27,768 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:16:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:27,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949401189] [2025-04-13 22:16:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949401189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:27,768 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939200959] [2025-04-13 22:16:27,768 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:27,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:27,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:27,770 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:16:27,771 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:16:28,044 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:28,067 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:28,067 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:28,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:28,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:16:28,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:28,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:28,137 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 58 treesize of output 34 [2025-04-13 22:16:28,171 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:16:28,171 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:28,261 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:28,261 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 44 treesize of output 77 [2025-04-13 22:16:28,317 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:16:28,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939200959] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:28,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:28,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:16:28,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570938333] [2025-04-13 22:16:28,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:28,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:16:28,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:28,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:16:28,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:16:28,318 INFO L87 Difference]: Start difference. First operand 229 states and 632 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) 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:16:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:29,278 INFO L93 Difference]: Finished difference Result 310 states and 798 transitions. [2025-04-13 22:16:29,278 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:16:29,278 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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 29 [2025-04-13 22:16:29,279 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:29,280 INFO L225 Difference]: With dead ends: 310 [2025-04-13 22:16:29,280 INFO L226 Difference]: Without dead ends: 296 [2025-04-13 22:16:29,280 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=1907, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:16:29,280 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:29,280 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:16:29,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-13 22:16:29,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 229. [2025-04-13 22:16:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.763157894736842) internal successors, (630), 228 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call 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:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 630 transitions. [2025-04-13 22:16:29,475 INFO L79 Accepts]: Start accepts. Automaton has 229 states and 630 transitions. Word has length 29 [2025-04-13 22:16:29,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:29,475 INFO L485 AbstractCegarLoop]: Abstraction has 229 states and 630 transitions. [2025-04-13 22:16:29,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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:16:29,475 INFO L278 IsEmpty]: Start isEmpty. Operand 229 states and 630 transitions. [2025-04-13 22:16:29,475 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:29,475 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:29,475 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:29,483 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:16:29,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:29,676 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:16:29,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1483184633, now seen corresponding path program 113 times [2025-04-13 22:16:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:29,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320452074] [2025-04-13 22:16:29,676 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:29,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:29,685 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:29,698 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:29,698 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:29,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:16:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:30,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320452074] [2025-04-13 22:16:30,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320452074] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:30,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595548409] [2025-04-13 22:16:30,052 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:30,054 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:16:30,055 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:16:30,337 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:30,413 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:30,414 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:30,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:30,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:16:30,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:30,529 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:30,529 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 73 treesize of output 45 [2025-04-13 22:16:30,560 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:16:30,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:30,656 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:30,656 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 71 treesize of output 88 [2025-04-13 22:16:30,723 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:16:30,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595548409] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:30,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:30,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2025-04-13 22:16:30,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375573434] [2025-04-13 22:16:30,724 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:30,724 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:16:30,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:30,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:16:30,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:16:30,724 INFO L87 Difference]: Start difference. First operand 229 states and 630 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:31,592 INFO L93 Difference]: Finished difference Result 306 states and 786 transitions. [2025-04-13 22:16:31,592 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:16:31,593 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:31,593 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:31,593 INFO L225 Difference]: With dead ends: 306 [2025-04-13 22:16:31,593 INFO L226 Difference]: Without dead ends: 299 [2025-04-13 22:16:31,594 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=1429, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:16:31,594 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:31,594 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-04-13 22:16:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 227. [2025-04-13 22:16:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 2.756637168141593) internal successors, (623), 226 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call 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:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 623 transitions. [2025-04-13 22:16:31,791 INFO L79 Accepts]: Start accepts. Automaton has 227 states and 623 transitions. Word has length 29 [2025-04-13 22:16:31,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:31,791 INFO L485 AbstractCegarLoop]: Abstraction has 227 states and 623 transitions. [2025-04-13 22:16:31,792 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:31,792 INFO L278 IsEmpty]: Start isEmpty. Operand 227 states and 623 transitions. [2025-04-13 22:16:31,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:31,792 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:31,792 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:31,800 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:16:31,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable121,116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:31,992 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:16:31,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:31,993 INFO L85 PathProgramCache]: Analyzing trace with hash 346915441, now seen corresponding path program 114 times [2025-04-13 22:16:31,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:31,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48725387] [2025-04-13 22:16:31,993 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:31,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:32,002 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:32,019 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:32,019 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:32,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:32,391 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:16:32,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:32,391 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48725387] [2025-04-13 22:16:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48725387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:32,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413719042] [2025-04-13 22:16:32,392 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:32,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:32,394 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:16:32,394 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:16:32,686 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:32,722 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:32,722 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:32,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:32,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:16:32,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:32,820 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:32,820 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 46 treesize of output 30 [2025-04-13 22:16:32,858 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:16:32,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:32,946 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:32,946 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 71 treesize of output 88 [2025-04-13 22:16:33,015 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:33,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413719042] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:33,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:33,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 22:16:33,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556642666] [2025-04-13 22:16:33,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:33,016 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:16:33,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:33,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:16:33,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:16:33,016 INFO L87 Difference]: Start difference. First operand 227 states and 623 transitions. Second operand has 24 states, 24 states have (on average 1.8333333333333333) 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:16:33,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:33,905 INFO L93 Difference]: Finished difference Result 282 states and 737 transitions. [2025-04-13 22:16:33,905 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:16:33,905 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.8333333333333333) 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 29 [2025-04-13 22:16:33,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:33,906 INFO L225 Difference]: With dead ends: 282 [2025-04-13 22:16:33,906 INFO L226 Difference]: Without dead ends: 275 [2025-04-13 22:16:33,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=1221, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:16:33,906 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:33,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:33,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-04-13 22:16:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 221. [2025-04-13 22:16:34,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.7454545454545456) internal successors, (604), 220 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call 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:34,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 604 transitions. [2025-04-13 22:16:34,099 INFO L79 Accepts]: Start accepts. Automaton has 221 states and 604 transitions. Word has length 29 [2025-04-13 22:16:34,099 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:34,099 INFO L485 AbstractCegarLoop]: Abstraction has 221 states and 604 transitions. [2025-04-13 22:16:34,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.8333333333333333) 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:16:34,099 INFO L278 IsEmpty]: Start isEmpty. Operand 221 states and 604 transitions. [2025-04-13 22:16:34,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:34,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:34,099 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:34,107 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:16:34,299 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,SelfDestructingSolverStorable122 [2025-04-13 22:16:34,300 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:16:34,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1024642879, now seen corresponding path program 115 times [2025-04-13 22:16:34,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:34,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124799533] [2025-04-13 22:16:34,300 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:34,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:34,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:16:34,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:34,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:34,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:16:34,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:34,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124799533] [2025-04-13 22:16:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124799533] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:34,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968845968] [2025-04-13 22:16:34,786 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:34,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:34,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:34,787 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:16:34,788 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:16:35,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:16:35,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:35,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:35,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:35,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:16:35,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:35,173 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:35,174 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 58 treesize of output 34 [2025-04-13 22:16:35,207 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:16:35,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:35,300 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:35,300 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 44 treesize of output 77 [2025-04-13 22:16:35,346 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:16:35,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968845968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:35,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:35,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:16:35,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528362749] [2025-04-13 22:16:35,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:35,346 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:16:35,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:35,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:16:35,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:35,346 INFO L87 Difference]: Start difference. First operand 221 states and 604 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:16:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:36,460 INFO L93 Difference]: Finished difference Result 326 states and 843 transitions. [2025-04-13 22:16:36,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:16:36,460 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:16:36,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:36,461 INFO L225 Difference]: With dead ends: 326 [2025-04-13 22:16:36,461 INFO L226 Difference]: Without dead ends: 315 [2025-04-13 22:16:36,461 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=274, Invalid=2078, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:16:36,461 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:36,461 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 722 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:36,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-04-13 22:16:36,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 229. [2025-04-13 22:16:36,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 2.780701754385965) internal successors, (634), 228 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call 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:36,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 634 transitions. [2025-04-13 22:16:36,663 INFO L79 Accepts]: Start accepts. Automaton has 229 states and 634 transitions. Word has length 29 [2025-04-13 22:16:36,663 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:36,663 INFO L485 AbstractCegarLoop]: Abstraction has 229 states and 634 transitions. [2025-04-13 22:16:36,663 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:16:36,663 INFO L278 IsEmpty]: Start isEmpty. Operand 229 states and 634 transitions. [2025-04-13 22:16:36,663 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:36,663 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:36,663 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:36,671 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:16:36,864 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2025-04-13 22:16:36,864 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:16:36,864 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:36,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2131374035, now seen corresponding path program 116 times [2025-04-13 22:16:36,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:36,864 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679085935] [2025-04-13 22:16:36,864 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:36,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:36,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:36,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:36,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:36,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 3 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:16:37,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:37,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679085935] [2025-04-13 22:16:37,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679085935] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:37,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989018034] [2025-04-13 22:16:37,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:37,746 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:16:37,746 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:16:38,046 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:38,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:38,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:38,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:38,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:16:38,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:38,239 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:38,239 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 65 treesize of output 41 [2025-04-13 22:16:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:16:38,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:38,372 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:38,372 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 44 treesize of output 77 [2025-04-13 22:16:38,450 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:16:38,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989018034] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:38,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:38,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 9] total 38 [2025-04-13 22:16:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046816679] [2025-04-13 22:16:38,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:38,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:16:38,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:38,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:16:38,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1250, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:16:38,451 INFO L87 Difference]: Start difference. First operand 229 states and 634 transitions. Second operand has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 38 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:16:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:39,831 INFO L93 Difference]: Finished difference Result 362 states and 956 transitions. [2025-04-13 22:16:39,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:16:39,831 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 38 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 29 [2025-04-13 22:16:39,831 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:39,832 INFO L225 Difference]: With dead ends: 362 [2025-04-13 22:16:39,832 INFO L226 Difference]: Without dead ends: 340 [2025-04-13 22:16:39,833 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=412, Invalid=3010, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:16:39,833 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:39,833 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-04-13 22:16:40,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 241. [2025-04-13 22:16:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.825) internal successors, (678), 240 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call 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:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 678 transitions. [2025-04-13 22:16:40,047 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 678 transitions. Word has length 29 [2025-04-13 22:16:40,047 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:40,047 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 678 transitions. [2025-04-13 22:16:40,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 38 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:16:40,047 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 678 transitions. [2025-04-13 22:16:40,047 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:40,047 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:40,047 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:40,055 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:16:40,247 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,SelfDestructingSolverStorable124 [2025-04-13 22:16:40,248 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:16:40,248 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash -994166686, now seen corresponding path program 117 times [2025-04-13 22:16:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:40,248 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774623973] [2025-04-13 22:16:40,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:40,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:40,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:16:40,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:16:40,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:16:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:40,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774623973] [2025-04-13 22:16:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774623973] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:40,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839918525] [2025-04-13 22:16:40,707 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:40,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:40,709 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:16:40,709 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:16:40,992 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:41,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 22:16:41,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:16:41,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:41,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 22:16:41,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:41,165 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:41,166 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 46 treesize of output 30 [2025-04-13 22:16:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:16:41,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:41,342 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:41,343 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 71 treesize of output 88 [2025-04-13 22:16:41,432 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:16:41,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839918525] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:41,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:41,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 30 [2025-04-13 22:16:41,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982004578] [2025-04-13 22:16:41,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:41,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:16:41,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:41,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:16:41,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:16:41,433 INFO L87 Difference]: Start difference. First operand 241 states and 678 transitions. Second operand has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 30 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:16:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:42,948 INFO L93 Difference]: Finished difference Result 372 states and 947 transitions. [2025-04-13 22:16:42,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:16:42,949 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 30 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:16:42,949 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:42,950 INFO L225 Difference]: With dead ends: 372 [2025-04-13 22:16:42,950 INFO L226 Difference]: Without dead ends: 362 [2025-04-13 22:16:42,950 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=423, Invalid=2999, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:16:42,950 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:42,950 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:16:42,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-04-13 22:16:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 249. [2025-04-13 22:16:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 248 states have (on average 2.846774193548387) internal successors, (706), 248 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call 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,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 706 transitions. [2025-04-13 22:16:43,169 INFO L79 Accepts]: Start accepts. Automaton has 249 states and 706 transitions. Word has length 29 [2025-04-13 22:16:43,169 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:43,170 INFO L485 AbstractCegarLoop]: Abstraction has 249 states and 706 transitions. [2025-04-13 22:16:43,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 30 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:16:43,170 INFO L278 IsEmpty]: Start isEmpty. Operand 249 states and 706 transitions. [2025-04-13 22:16:43,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:43,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:43,170 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:43,178 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:16:43,370 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,SelfDestructingSolverStorable125 [2025-04-13 22:16:43,370 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:16:43,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:43,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2133117068, now seen corresponding path program 118 times [2025-04-13 22:16:43,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:43,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872863657] [2025-04-13 22:16:43,371 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:43,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:43,380 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:43,392 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:43,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:43,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:43,879 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:16:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:43,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872863657] [2025-04-13 22:16:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872863657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:43,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327777039] [2025-04-13 22:16:43,879 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:43,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:43,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:43,881 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:16:43,881 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:16:44,173 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:44,197 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:44,197 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:44,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:44,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:16:44,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:44,286 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:44,286 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 58 treesize of output 34 [2025-04-13 22:16:44,316 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:16:44,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:44,412 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:44,412 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 71 treesize of output 88 [2025-04-13 22:16:44,479 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:44,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327777039] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:44,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:44,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:16:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229535842] [2025-04-13 22:16:44,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:44,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:16:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:44,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:16:44,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:16:44,480 INFO L87 Difference]: Start difference. First operand 249 states and 706 transitions. Second operand has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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:16:45,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:45,410 INFO L93 Difference]: Finished difference Result 317 states and 839 transitions. [2025-04-13 22:16:45,410 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:16:45,410 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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 29 [2025-04-13 22:16:45,410 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:45,411 INFO L225 Difference]: With dead ends: 317 [2025-04-13 22:16:45,411 INFO L226 Difference]: Without dead ends: 307 [2025-04-13 22:16:45,411 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1817, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:16:45,411 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:45,411 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:16:45,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-04-13 22:16:45,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 243. [2025-04-13 22:16:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.8140495867768593) internal successors, (681), 242 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call 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:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 681 transitions. [2025-04-13 22:16:45,630 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 681 transitions. Word has length 29 [2025-04-13 22:16:45,630 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:45,630 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 681 transitions. [2025-04-13 22:16:45,630 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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:16:45,630 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 681 transitions. [2025-04-13 22:16:45,630 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:45,630 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:45,630 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:45,638 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:16:45,831 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,SelfDestructingSolverStorable126 [2025-04-13 22:16:45,831 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:16:45,831 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1107670396, now seen corresponding path program 119 times [2025-04-13 22:16:45,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:45,831 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579019579] [2025-04-13 22:16:45,831 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:45,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:45,842 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:45,856 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:45,856 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:45,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:46,216 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:16:46,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:46,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579019579] [2025-04-13 22:16:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579019579] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:46,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800456834] [2025-04-13 22:16:46,216 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:16:46,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:46,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:46,218 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:16:46,219 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:16:46,518 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:46,615 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:46,615 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:16:46,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:46,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:16:46,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:46,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:46,755 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 65 treesize of output 41 [2025-04-13 22:16:46,785 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:16:46,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:46,880 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:46,880 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 71 treesize of output 88 [2025-04-13 22:16:46,946 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:16:46,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800456834] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:46,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:46,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 27 [2025-04-13 22:16:46,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153655733] [2025-04-13 22:16:46,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:46,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:16:46,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:46,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:16:46,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:16:46,947 INFO L87 Difference]: Start difference. First operand 243 states and 681 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:16:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:48,136 INFO L93 Difference]: Finished difference Result 324 states and 853 transitions. [2025-04-13 22:16:48,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:16:48,136 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:16:48,136 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:48,137 INFO L225 Difference]: With dead ends: 324 [2025-04-13 22:16:48,137 INFO L226 Difference]: Without dead ends: 310 [2025-04-13 22:16:48,137 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=1755, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:16:48,137 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:48,138 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 1126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:48,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-04-13 22:16:48,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 253. [2025-04-13 22:16:48,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 2.8174603174603177) internal successors, (710), 252 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call 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,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 710 transitions. [2025-04-13 22:16:48,365 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 710 transitions. Word has length 29 [2025-04-13 22:16:48,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:48,365 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 710 transitions. [2025-04-13 22:16:48,365 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:16:48,365 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 710 transitions. [2025-04-13 22:16:48,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:48,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:48,366 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:48,374 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:16:48,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:48,566 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:16:48,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:48,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2075962775, now seen corresponding path program 120 times [2025-04-13 22:16:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:48,567 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346494158] [2025-04-13 22:16:48,567 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:48,576 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:48,591 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:48,591 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:48,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:48,923 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:16:48,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:48,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346494158] [2025-04-13 22:16:48,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346494158] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:48,923 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40376053] [2025-04-13 22:16:48,923 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:16:48,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:48,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:48,925 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:16:48,926 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:16:49,219 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:49,251 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:49,252 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:16:49,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:49,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:16:49,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:49,327 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:49,327 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 65 treesize of output 41 [2025-04-13 22:16:49,349 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:16:49,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:49,428 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:49,428 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 44 treesize of output 77 [2025-04-13 22:16:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40376053] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:49,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 22:16:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387099047] [2025-04-13 22:16:49,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:49,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:16:49,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:49,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:16:49,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:16:49,479 INFO L87 Difference]: Start difference. First operand 253 states and 710 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:16:50,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:50,585 INFO L93 Difference]: Finished difference Result 367 states and 979 transitions. [2025-04-13 22:16:50,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:16:50,586 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:16:50,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:50,587 INFO L225 Difference]: With dead ends: 367 [2025-04-13 22:16:50,587 INFO L226 Difference]: Without dead ends: 360 [2025-04-13 22:16:50,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:16:50,587 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:50,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:16:50,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-04-13 22:16:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 255. [2025-04-13 22:16:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 2.8070866141732282) internal successors, (713), 254 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call 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:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 713 transitions. [2025-04-13 22:16:50,835 INFO L79 Accepts]: Start accepts. Automaton has 255 states and 713 transitions. Word has length 29 [2025-04-13 22:16:50,835 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:50,835 INFO L485 AbstractCegarLoop]: Abstraction has 255 states and 713 transitions. [2025-04-13 22:16:50,835 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:16:50,835 INFO L278 IsEmpty]: Start isEmpty. Operand 255 states and 713 transitions. [2025-04-13 22:16:50,835 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:50,835 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:50,835 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:50,843 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:16:51,035 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable128,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:51,036 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:16:51,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1082735329, now seen corresponding path program 121 times [2025-04-13 22:16:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:51,036 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816660895] [2025-04-13 22:16:51,036 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:51,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:16:51,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:51,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:51,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:51,524 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:16:51,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:51,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816660895] [2025-04-13 22:16:51,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816660895] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:51,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441544520] [2025-04-13 22:16:51,524 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:16:51,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:51,526 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:16:51,527 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:16:51,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:16:51,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:51,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:16:51,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:51,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:16:51,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:51,922 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:51,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 58 treesize of output 34 [2025-04-13 22:16:51,953 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:16:51,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:52,044 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:52,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 44 treesize of output 77 [2025-04-13 22:16:52,082 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:16:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441544520] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:52,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2025-04-13 22:16:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767945] [2025-04-13 22:16:52,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:52,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:16:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:52,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:16:52,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:16:52,083 INFO L87 Difference]: Start difference. First operand 255 states and 713 transitions. Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:16:53,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:53,398 INFO L93 Difference]: Finished difference Result 362 states and 943 transitions. [2025-04-13 22:16:53,398 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:16:53,398 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:16:53,398 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:53,399 INFO L225 Difference]: With dead ends: 362 [2025-04-13 22:16:53,399 INFO L226 Difference]: Without dead ends: 355 [2025-04-13 22:16:53,399 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=2177, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:16:53,399 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:53,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:16:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-04-13 22:16:53,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 235. [2025-04-13 22:16:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.7564102564102564) internal successors, (645), 234 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call 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:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 645 transitions. [2025-04-13 22:16:53,617 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 645 transitions. Word has length 29 [2025-04-13 22:16:53,617 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:53,617 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 645 transitions. [2025-04-13 22:16:53,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:16:53,617 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 645 transitions. [2025-04-13 22:16:53,617 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:53,618 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:53,618 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:53,625 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:16:53,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2025-04-13 22:16:53,818 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:16:53,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:53,818 INFO L85 PathProgramCache]: Analyzing trace with hash -500660815, now seen corresponding path program 122 times [2025-04-13 22:16:53,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:53,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455686036] [2025-04-13 22:16:53,818 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:53,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:53,828 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:53,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:53,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:53,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:16:54,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:54,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455686036] [2025-04-13 22:16:54,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455686036] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:54,268 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912263710] [2025-04-13 22:16:54,268 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:16:54,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:54,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:54,269 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:16:54,270 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:16:54,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:54,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:54,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:16:54,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:54,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:16:54,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:16:54,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:54,837 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:54,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 44 treesize of output 77 [2025-04-13 22:16:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:54,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912263710] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:54,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:54,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:16:54,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007613768] [2025-04-13 22:16:54,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:54,916 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:16:54,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:54,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:16:54,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:16:54,917 INFO L87 Difference]: Start difference. First operand 235 states and 645 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:16:55,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:55,904 INFO L93 Difference]: Finished difference Result 324 states and 849 transitions. [2025-04-13 22:16:55,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:16:55,905 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:16:55,905 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:55,905 INFO L225 Difference]: With dead ends: 324 [2025-04-13 22:16:55,906 INFO L226 Difference]: Without dead ends: 317 [2025-04-13 22:16:55,906 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:16:55,906 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:55,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:16:55,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-04-13 22:16:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 231. [2025-04-13 22:16:56,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 2.734782608695652) internal successors, (629), 230 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call 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:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 629 transitions. [2025-04-13 22:16:56,122 INFO L79 Accepts]: Start accepts. Automaton has 231 states and 629 transitions. Word has length 29 [2025-04-13 22:16:56,122 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:56,122 INFO L485 AbstractCegarLoop]: Abstraction has 231 states and 629 transitions. [2025-04-13 22:16:56,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:16:56,122 INFO L278 IsEmpty]: Start isEmpty. Operand 231 states and 629 transitions. [2025-04-13 22:16:56,122 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:56,122 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:56,122 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:56,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Forceful destruction successful, exit code 0 [2025-04-13 22:16:56,323 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:56,323 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:16:56,323 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:56,323 INFO L85 PathProgramCache]: Analyzing trace with hash -248201220, now seen corresponding path program 123 times [2025-04-13 22:16:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:56,323 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254683067] [2025-04-13 22:16:56,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:56,333 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:56,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 22:16:56,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:16:56,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:56,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:56,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254683067] [2025-04-13 22:16:56,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254683067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:56,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019148589] [2025-04-13 22:16:56,619 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:16:56,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:56,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:56,620 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:16:56,621 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:16:56,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:16:56,952 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 22:16:56,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:16:56,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:56,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:16:56,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:57,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:57,202 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:16:57,202 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 71 treesize of output 88 [2025-04-13 22:16:57,292 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:16:57,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019148589] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:57,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:57,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:16:57,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918274361] [2025-04-13 22:16:57,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:57,292 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:16:57,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:57,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:16:57,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:16:57,293 INFO L87 Difference]: Start difference. First operand 231 states and 629 transitions. Second operand has 25 states, 25 states have (on average 1.88) 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:16:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:16:58,094 INFO L93 Difference]: Finished difference Result 276 states and 732 transitions. [2025-04-13 22:16:58,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:16:58,095 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) 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 29 [2025-04-13 22:16:58,095 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:16:58,095 INFO L225 Difference]: With dead ends: 276 [2025-04-13 22:16:58,096 INFO L226 Difference]: Without dead ends: 259 [2025-04-13 22:16:58,096 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:16:58,096 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:16:58,096 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:16:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-04-13 22:16:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 231. [2025-04-13 22:16:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 2.717391304347826) internal successors, (625), 230 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call 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,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 625 transitions. [2025-04-13 22:16:58,309 INFO L79 Accepts]: Start accepts. Automaton has 231 states and 625 transitions. Word has length 29 [2025-04-13 22:16:58,310 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:16:58,310 INFO L485 AbstractCegarLoop]: Abstraction has 231 states and 625 transitions. [2025-04-13 22:16:58,310 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) 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:16:58,310 INFO L278 IsEmpty]: Start isEmpty. Operand 231 states and 625 transitions. [2025-04-13 22:16:58,310 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:16:58,310 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:16:58,310 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:58,319 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:16:58,511 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:58,511 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:16:58,511 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:16:58,511 INFO L85 PathProgramCache]: Analyzing trace with hash -102733459, now seen corresponding path program 124 times [2025-04-13 22:16:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:16:58,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631118522] [2025-04-13 22:16:58,511 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:58,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:16:58,521 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:58,532 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:58,532 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:58,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:59,000 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:16:59,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:16:59,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631118522] [2025-04-13 22:16:59,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631118522] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:16:59,000 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432588894] [2025-04-13 22:16:59,000 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:16:59,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:16:59,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:16:59,002 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:16:59,003 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:16:59,298 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:16:59,322 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:16:59,322 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:16:59,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:16:59,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:16:59,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:16:59,410 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:16:59,410 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 58 treesize of output 34 [2025-04-13 22:16:59,445 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:16:59,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:16:59,560 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:16:59,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 46 treesize of output 83 [2025-04-13 22:16:59,614 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:16:59,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432588894] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:16:59,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:16:59,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:16:59,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327261339] [2025-04-13 22:16:59,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:16:59,615 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:16:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:16:59,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:16:59,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:16:59,615 INFO L87 Difference]: Start difference. First operand 231 states and 625 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) 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:17:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:00,936 INFO L93 Difference]: Finished difference Result 333 states and 860 transitions. [2025-04-13 22:17:00,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:17:00,936 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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 29 [2025-04-13 22:17:00,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:00,937 INFO L225 Difference]: With dead ends: 333 [2025-04-13 22:17:00,937 INFO L226 Difference]: Without dead ends: 322 [2025-04-13 22:17:00,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:17:00,938 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:00,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-04-13 22:17:01,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 243. [2025-04-13 22:17:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.7644628099173554) internal successors, (669), 242 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call 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:01,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 669 transitions. [2025-04-13 22:17:01,170 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 669 transitions. Word has length 29 [2025-04-13 22:17:01,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:01,170 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 669 transitions. [2025-04-13 22:17:01,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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:17:01,170 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 669 transitions. [2025-04-13 22:17:01,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:01,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:01,170 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:01,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2025-04-13 22:17:01,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:01,371 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:17:01,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash 638289567, now seen corresponding path program 125 times [2025-04-13 22:17:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:01,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480495092] [2025-04-13 22:17:01,371 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:01,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:01,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:01,398 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:01,398 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:01,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:17:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:02,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480495092] [2025-04-13 22:17:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480495092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:02,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645214559] [2025-04-13 22:17:02,086 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:02,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:02,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:02,087 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:17:02,089 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:17:02,394 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:02,475 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:02,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:02,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:02,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:17:02,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:02,629 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:02,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:02,727 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:02,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 44 treesize of output 77 [2025-04-13 22:17:02,798 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:02,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645214559] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:02,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:02,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 9] total 31 [2025-04-13 22:17:02,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721341414] [2025-04-13 22:17:02,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:02,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:17:02,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:02,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:17:02,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:17:02,799 INFO L87 Difference]: Start difference. First operand 243 states and 669 transitions. Second operand has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:03,875 INFO L93 Difference]: Finished difference Result 326 states and 869 transitions. [2025-04-13 22:17:03,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:17:03,876 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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:03,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:03,877 INFO L225 Difference]: With dead ends: 326 [2025-04-13 22:17:03,877 INFO L226 Difference]: Without dead ends: 319 [2025-04-13 22:17:03,877 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=1767, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:17:03,877 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:03,877 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:03,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-13 22:17:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 237. [2025-04-13 22:17:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 2.7457627118644066) internal successors, (648), 236 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:17:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 648 transitions. [2025-04-13 22:17:04,099 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 648 transitions. Word has length 29 [2025-04-13 22:17:04,099 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:04,099 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 648 transitions. [2025-04-13 22:17:04,099 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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:04,099 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 648 transitions. [2025-04-13 22:17:04,099 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:04,099 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:04,099 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:04,107 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:17:04,299 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable133,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:04,300 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:17:04,300 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:04,300 INFO L85 PathProgramCache]: Analyzing trace with hash -72257266, now seen corresponding path program 126 times [2025-04-13 22:17:04,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:04,300 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593971432] [2025-04-13 22:17:04,300 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:04,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:04,310 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:04,326 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:04,326 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:04,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:04,823 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:04,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:04,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593971432] [2025-04-13 22:17:04,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593971432] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:04,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549495523] [2025-04-13 22:17:04,824 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:04,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:04,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:04,826 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:17:04,826 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:17:05,142 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:05,171 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:05,171 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:05,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:05,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 22:17:05,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:05,338 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:05,338 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 46 treesize of output 30 [2025-04-13 22:17:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:17:05,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:05,542 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:05,542 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 73 treesize of output 94 [2025-04-13 22:17:05,627 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:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549495523] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:05,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:05,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 10] total 29 [2025-04-13 22:17:05,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498633354] [2025-04-13 22:17:05,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:05,627 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:17:05,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:05,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:17:05,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=698, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:17:05,628 INFO L87 Difference]: Start difference. First operand 237 states and 648 transitions. Second operand has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:07,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:07,042 INFO L93 Difference]: Finished difference Result 348 states and 896 transitions. [2025-04-13 22:17:07,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:17:07,042 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:07,042 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:07,043 INFO L225 Difference]: With dead ends: 348 [2025-04-13 22:17:07,043 INFO L226 Difference]: Without dead ends: 338 [2025-04-13 22:17:07,043 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=381, Invalid=2375, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:17:07,044 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:07,044 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-04-13 22:17:07,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 245. [2025-04-13 22:17:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.7704918032786887) internal successors, (676), 244 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call 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:07,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 676 transitions. [2025-04-13 22:17:07,275 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 676 transitions. Word has length 29 [2025-04-13 22:17:07,275 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:07,275 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 676 transitions. [2025-04-13 22:17:07,275 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 29 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:07,275 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 676 transitions. [2025-04-13 22:17:07,275 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:07,275 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:07,275 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:07,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:07,476 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,SelfDestructingSolverStorable134 [2025-04-13 22:17:07,476 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:17:07,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash -799673067, now seen corresponding path program 127 times [2025-04-13 22:17:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:07,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560762666] [2025-04-13 22:17:07,476 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:07,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:07,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:07,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:07,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:17:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:07,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560762666] [2025-04-13 22:17:07,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560762666] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:07,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996491432] [2025-04-13 22:17:07,954 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:07,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:07,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:07,957 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:17:07,957 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:17:08,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:08,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:08,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:08,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:08,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:17:08,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:08,378 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:08,378 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:08,472 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:08,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 73 treesize of output 94 [2025-04-13 22:17:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:08,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996491432] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:08,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:08,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:17:08,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027031012] [2025-04-13 22:17:08,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:08,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:08,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:08,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:08,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:08,517 INFO L87 Difference]: Start difference. First operand 245 states and 676 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:09,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:09,294 INFO L93 Difference]: Finished difference Result 274 states and 731 transitions. [2025-04-13 22:17:09,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:17:09,294 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:09,294 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:09,295 INFO L225 Difference]: With dead ends: 274 [2025-04-13 22:17:09,295 INFO L226 Difference]: Without dead ends: 257 [2025-04-13 22:17:09,295 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1677, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:17:09,295 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:09,295 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 0 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:09,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-04-13 22:17:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 245. [2025-04-13 22:17:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.762295081967213) internal successors, (674), 244 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call 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:09,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 674 transitions. [2025-04-13 22:17:09,525 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 674 transitions. Word has length 29 [2025-04-13 22:17:09,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:09,525 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 674 transitions. [2025-04-13 22:17:09,525 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:09,525 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 674 transitions. [2025-04-13 22:17:09,526 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:09,526 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:09,526 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:09,533 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:17:09,726 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,SelfDestructingSolverStorable135 [2025-04-13 22:17:09,726 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:17:09,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash -185760976, now seen corresponding path program 128 times [2025-04-13 22:17:09,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:09,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058633801] [2025-04-13 22:17:09,727 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:09,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:09,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:09,750 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:09,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:09,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:10,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:10,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058633801] [2025-04-13 22:17:10,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058633801] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:10,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301987091] [2025-04-13 22:17:10,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:10,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:10,373 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:17:10,374 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:17:10,684 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:10,710 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:10,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:10,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:10,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:17:10,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:10,859 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:10,860 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 65 treesize of output 41 [2025-04-13 22:17:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:17:10,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:10,992 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:10,993 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 73 treesize of output 94 [2025-04-13 22:17:11,076 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:11,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301987091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:11,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:11,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 9] total 32 [2025-04-13 22:17:11,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404432849] [2025-04-13 22:17:11,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:11,077 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:17:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:11,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:17:11,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:17:11,077 INFO L87 Difference]: Start difference. First operand 245 states and 674 transitions. Second operand has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 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:17:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:12,580 INFO L93 Difference]: Finished difference Result 348 states and 872 transitions. [2025-04-13 22:17:12,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:17:12,580 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 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 29 [2025-04-13 22:17:12,580 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:12,581 INFO L225 Difference]: With dead ends: 348 [2025-04-13 22:17:12,581 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 22:17:12,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=348, Invalid=2622, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:17:12,581 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:12,581 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 22:17:12,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 245. [2025-04-13 22:17:12,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.7459016393442623) internal successors, (670), 244 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call 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:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 670 transitions. [2025-04-13 22:17:12,819 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 670 transitions. Word has length 29 [2025-04-13 22:17:12,819 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:12,819 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 670 transitions. [2025-04-13 22:17:12,819 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 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:17:12,820 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 670 transitions. [2025-04-13 22:17:12,820 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:12,820 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:12,820 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:12,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0 [2025-04-13 22:17:13,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2025-04-13 22:17:13,020 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:17:13,020 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:13,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1576822666, now seen corresponding path program 129 times [2025-04-13 22:17:13,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:13,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614710792] [2025-04-13 22:17:13,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:13,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:13,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:13,043 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:13,043 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:13,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:13,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:13,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614710792] [2025-04-13 22:17:13,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614710792] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:13,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036615978] [2025-04-13 22:17:13,323 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:13,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:13,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:13,324 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:17:13,325 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:17:13,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:13,670 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:13,670 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:13,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:13,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:17:13,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:13,822 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:13,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:13,939 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:13,940 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:17:14,006 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:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036615978] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:14,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 26 [2025-04-13 22:17:14,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701866027] [2025-04-13 22:17:14,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:14,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:17:14,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:14,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:17:14,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:17:14,007 INFO L87 Difference]: Start difference. First operand 245 states and 670 transitions. Second operand has 26 states, 26 states have (on average 1.8846153846153846) 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:17:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:14,863 INFO L93 Difference]: Finished difference Result 304 states and 806 transitions. [2025-04-13 22:17:14,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:17:14,864 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8846153846153846) 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 29 [2025-04-13 22:17:14,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:14,865 INFO L225 Difference]: With dead ends: 304 [2025-04-13 22:17:14,865 INFO L226 Difference]: Without dead ends: 296 [2025-04-13 22:17:14,865 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1354, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:17:14,865 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:14,865 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:14,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-13 22:17:15,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 245. [2025-04-13 22:17:15,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.7459016393442623) internal successors, (670), 244 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call 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:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 670 transitions. [2025-04-13 22:17:15,107 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 670 transitions. Word has length 29 [2025-04-13 22:17:15,107 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:15,107 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 670 transitions. [2025-04-13 22:17:15,107 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8846153846153846) 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:17:15,107 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 670 transitions. [2025-04-13 22:17:15,108 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:15,108 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:15,108 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:15,116 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:17:15,308 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:15,308 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:17:15,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash -160825909, now seen corresponding path program 130 times [2025-04-13 22:17:15,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:15,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913759255] [2025-04-13 22:17:15,309 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:15,318 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:15,329 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:15,329 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:15,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:15,807 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:15,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:15,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913759255] [2025-04-13 22:17:15,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913759255] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:15,808 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580345028] [2025-04-13 22:17:15,808 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:15,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:15,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:15,810 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:17:15,810 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:17:16,129 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:16,152 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:16,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:16,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:16,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:17:16,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:16,232 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:16,233 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 58 treesize of output 34 [2025-04-13 22:17:16,264 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:16,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:16,382 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:16,382 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:17:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:16,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [580345028] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:16,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:16,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:17:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945010121] [2025-04-13 22:17:16,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:16,429 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:17:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:16,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:17:16,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:17:16,429 INFO L87 Difference]: Start difference. First operand 245 states and 670 transitions. Second operand has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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:17:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:17,930 INFO L93 Difference]: Finished difference Result 341 states and 870 transitions. [2025-04-13 22:17:17,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:17:17,930 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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 29 [2025-04-13 22:17:17,931 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:17,932 INFO L225 Difference]: With dead ends: 341 [2025-04-13 22:17:17,932 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 22:17:17,932 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=2341, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:17:17,932 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:17,932 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:17,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 22:17:18,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 235. [2025-04-13 22:17:18,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.730769230769231) internal successors, (639), 234 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call 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,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 639 transitions. [2025-04-13 22:17:18,160 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 639 transitions. Word has length 29 [2025-04-13 22:17:18,160 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:18,160 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 639 transitions. [2025-04-13 22:17:18,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 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:17:18,160 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 639 transitions. [2025-04-13 22:17:18,160 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:18,160 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:18,161 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,168 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:17:18,361 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2025-04-13 22:17:18,361 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:17:18,361 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1784680921, now seen corresponding path program 131 times [2025-04-13 22:17:18,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:18,361 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943939197] [2025-04-13 22:17:18,361 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:18,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:18,371 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:18,385 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,386 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:18,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:18,747 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:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:18,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943939197] [2025-04-13 22:17:18,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943939197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:18,748 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667921560] [2025-04-13 22:17:18,748 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:18,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:18,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:18,749 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:17:18,750 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:17:19,066 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:19,200 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:19,200 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:19,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:19,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:17:19,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:17:19,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:19,468 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:19,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 73 treesize of output 94 [2025-04-13 22:17:19,518 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,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667921560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:19,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:19,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-04-13 22:17:19,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451850356] [2025-04-13 22:17:19,519 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:19,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:17:19,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:19,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:17:19,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:17:19,519 INFO L87 Difference]: Start difference. First operand 235 states and 639 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) 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:17:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:20,287 INFO L93 Difference]: Finished difference Result 266 states and 707 transitions. [2025-04-13 22:17:20,287 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:17:20,287 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) 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 29 [2025-04-13 22:17:20,287 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:20,288 INFO L225 Difference]: With dead ends: 266 [2025-04-13 22:17:20,288 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 22:17:20,288 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=1252, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:17:20,289 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:20,289 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 22:17:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 237. [2025-04-13 22:17:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 2.7288135593220337) internal successors, (644), 236 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call 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,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 644 transitions. [2025-04-13 22:17:20,517 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 644 transitions. Word has length 29 [2025-04-13 22:17:20,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:20,517 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 644 transitions. [2025-04-13 22:17:20,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) 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:17:20,517 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 644 transitions. [2025-04-13 22:17:20,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:20,517 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:20,517 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:20,525 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:17:20,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable139 [2025-04-13 22:17:20,718 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:17:20,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash 673708200, now seen corresponding path program 132 times [2025-04-13 22:17:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:20,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210477569] [2025-04-13 22:17:20,718 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:20,728 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:20,743 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:20,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:20,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:21,094 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:21,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:21,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210477569] [2025-04-13 22:17:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210477569] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:21,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461319206] [2025-04-13 22:17:21,094 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:21,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:21,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:21,096 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:17:21,097 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:17:21,417 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:21,499 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,500 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:21,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:21,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:17:21,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:21,701 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:21,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:21,813 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:21,813 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 73 treesize of output 94 [2025-04-13 22:17:21,892 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:21,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461319206] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:21,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:21,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2025-04-13 22:17:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875660510] [2025-04-13 22:17:21,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:21,892 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:17:21,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:21,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:17:21,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:17:21,893 INFO L87 Difference]: Start difference. First operand 237 states and 644 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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:17:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:22,883 INFO L93 Difference]: Finished difference Result 294 states and 752 transitions. [2025-04-13 22:17:22,883 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:17:22,883 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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 29 [2025-04-13 22:17:22,883 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:22,884 INFO L225 Difference]: With dead ends: 294 [2025-04-13 22:17:22,884 INFO L226 Difference]: Without dead ends: 274 [2025-04-13 22:17:22,884 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:17:22,884 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:22,884 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:22,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-04-13 22:17:23,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 237. [2025-04-13 22:17:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 236 states have (on average 2.7203389830508473) internal successors, (642), 236 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call 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:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 642 transitions. [2025-04-13 22:17:23,113 INFO L79 Accepts]: Start accepts. Automaton has 237 states and 642 transitions. Word has length 29 [2025-04-13 22:17:23,113 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:23,113 INFO L485 AbstractCegarLoop]: Abstraction has 237 states and 642 transitions. [2025-04-13 22:17:23,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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:17:23,113 INFO L278 IsEmpty]: Start isEmpty. Operand 237 states and 642 transitions. [2025-04-13 22:17:23,114 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:23,114 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:23,114 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:23,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2025-04-13 22:17:23,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:23,314 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:17:23,314 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1565524392, now seen corresponding path program 133 times [2025-04-13 22:17:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:23,314 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247070165] [2025-04-13 22:17:23,314 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:23,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:23,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:23,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:23,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:23,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:23,773 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:23,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:23,773 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247070165] [2025-04-13 22:17:23,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247070165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:23,774 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080968927] [2025-04-13 22:17:23,774 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:23,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:23,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:23,775 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:17:23,776 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:17:24,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:24,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:24,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:24,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:24,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:17:24,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:24,245 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:17:24,245 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 33 treesize of output 9 [2025-04-13 22:17:24,259 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:24,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:24,527 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:24,528 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:17:24,583 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:24,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080968927] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:24,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:24,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 33 [2025-04-13 22:17:24,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544050547] [2025-04-13 22:17:24,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:24,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:17:24,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:24,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:17:24,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:17:24,584 INFO L87 Difference]: Start difference. First operand 237 states and 642 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:26,245 INFO L93 Difference]: Finished difference Result 331 states and 862 transitions. [2025-04-13 22:17:26,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:17:26,245 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:26,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:26,246 INFO L225 Difference]: With dead ends: 331 [2025-04-13 22:17:26,246 INFO L226 Difference]: Without dead ends: 319 [2025-04-13 22:17:26,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 748 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=420, Invalid=3002, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:17:26,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:26,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-13 22:17:26,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 243. [2025-04-13 22:17:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.7231404958677685) internal successors, (659), 242 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call 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:26,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 659 transitions. [2025-04-13 22:17:26,484 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 659 transitions. Word has length 29 [2025-04-13 22:17:26,484 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:26,484 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 659 transitions. [2025-04-13 22:17:26,484 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:26,485 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 659 transitions. [2025-04-13 22:17:26,485 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:26,485 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:26,485 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:26,495 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:17:26,685 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:26,685 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:17:26,685 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1560198987, now seen corresponding path program 134 times [2025-04-13 22:17:26,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:26,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267214852] [2025-04-13 22:17:26,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:26,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:26,710 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:26,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:26,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:17:27,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:27,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267214852] [2025-04-13 22:17:27,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267214852] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:27,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445852984] [2025-04-13 22:17:27,329 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:27,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:27,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:27,331 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:17:27,332 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:17:27,658 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:27,683 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:27,683 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:27,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:27,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:17:27,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:27,894 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:17:27,894 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 25 treesize of output 9 [2025-04-13 22:17:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:17:27,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:28,018 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:28,019 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:17:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445852984] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:28,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 9] total 34 [2025-04-13 22:17:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825339247] [2025-04-13 22:17:28,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:28,101 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:17:28,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:28,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:17:28,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:17:28,101 INFO L87 Difference]: Start difference. First operand 243 states and 659 transitions. Second operand has 34 states, 34 states have (on average 1.7941176470588236) 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:17:29,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:29,291 INFO L93 Difference]: Finished difference Result 323 states and 841 transitions. [2025-04-13 22:17:29,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:17:29,292 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7941176470588236) 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 29 [2025-04-13 22:17:29,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:29,293 INFO L225 Difference]: With dead ends: 323 [2025-04-13 22:17:29,293 INFO L226 Difference]: Without dead ends: 316 [2025-04-13 22:17:29,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=331, Invalid=2425, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:17:29,293 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 145 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:29,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 0 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:29,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-04-13 22:17:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 241. [2025-04-13 22:17:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.725) internal successors, (654), 240 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call 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,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 654 transitions. [2025-04-13 22:17:29,525 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 654 transitions. Word has length 29 [2025-04-13 22:17:29,525 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:29,525 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 654 transitions. [2025-04-13 22:17:29,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7941176470588236) 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:17:29,525 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 654 transitions. [2025-04-13 22:17:29,525 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:29,525 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:29,525 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,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:29,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:29,726 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:17:29,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:29,726 INFO L85 PathProgramCache]: Analyzing trace with hash 66931861, now seen corresponding path program 135 times [2025-04-13 22:17:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:29,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19885425] [2025-04-13 22:17:29,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:29,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:29,736 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:29,755 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:29,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:29,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:30,103 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:30,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:30,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19885425] [2025-04-13 22:17:30,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19885425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:30,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851837189] [2025-04-13 22:17:30,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:30,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:30,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:30,105 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:17:30,106 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:17:30,432 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:30,457 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:30,457 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:17:30,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:30,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 22:17:30,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:30,619 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:30,619 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 46 treesize of output 30 [2025-04-13 22:17:30,651 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:30,651 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:30,754 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:30,754 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 73 treesize of output 94 [2025-04-13 22:17:30,821 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:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851837189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:30,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:30,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 22:17:30,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024521390] [2025-04-13 22:17:30,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:30,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:17:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:30,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:17:30,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:17:30,822 INFO L87 Difference]: Start difference. First operand 241 states and 654 transitions. Second operand has 25 states, 25 states have (on average 1.88) 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:17:31,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:31,925 INFO L93 Difference]: Finished difference Result 320 states and 833 transitions. [2025-04-13 22:17:31,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:17:31,925 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.88) 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 29 [2025-04-13 22:17:31,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:31,926 INFO L225 Difference]: With dead ends: 320 [2025-04-13 22:17:31,926 INFO L226 Difference]: Without dead ends: 309 [2025-04-13 22:17:31,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=1380, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:17:31,926 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 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:17:31,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 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:17:31,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-04-13 22:17:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 245. [2025-04-13 22:17:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.7459016393442623) internal successors, (670), 244 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call 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,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 670 transitions. [2025-04-13 22:17:32,164 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 670 transitions. Word has length 29 [2025-04-13 22:17:32,164 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:32,164 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 670 transitions. [2025-04-13 22:17:32,164 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.88) 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:17:32,164 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 670 transitions. [2025-04-13 22:17:32,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:32,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:32,164 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:32,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:32,364 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,SelfDestructingSolverStorable143 [2025-04-13 22:17:32,364 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:17:32,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1547448880, now seen corresponding path program 136 times [2025-04-13 22:17:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:32,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366170520] [2025-04-13 22:17:32,365 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:32,375 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:32,384 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:32,384 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:32,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:17:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:32,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366170520] [2025-04-13 22:17:32,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366170520] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:32,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251100780] [2025-04-13 22:17:32,842 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:32,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:32,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:32,843 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:17:32,844 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:17:33,180 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:33,206 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:33,206 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:33,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:33,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:17:33,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:33,302 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:33,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:33,400 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:33,401 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 73 treesize of output 94 [2025-04-13 22:17:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:33,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251100780] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:33,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:33,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:17:33,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856727842] [2025-04-13 22:17:33,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:33,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:33,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:33,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:33,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:33,460 INFO L87 Difference]: Start difference. First operand 245 states and 670 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) 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:17:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:34,296 INFO L93 Difference]: Finished difference Result 276 states and 729 transitions. [2025-04-13 22:17:34,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:17:34,296 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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 29 [2025-04-13 22:17:34,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:34,297 INFO L225 Difference]: With dead ends: 276 [2025-04-13 22:17:34,297 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 22:17:34,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=1677, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:17:34,297 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:34,297 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 22:17:34,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2025-04-13 22:17:34,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.737704918032787) internal successors, (668), 244 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call 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:34,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 668 transitions. [2025-04-13 22:17:34,540 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 668 transitions. Word has length 29 [2025-04-13 22:17:34,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:34,540 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 668 transitions. [2025-04-13 22:17:34,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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:17:34,540 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 668 transitions. [2025-04-13 22:17:34,540 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:34,540 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:34,540 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:34,548 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:17:34,741 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,SelfDestructingSolverStorable144 [2025-04-13 22:17:34,741 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:17:34,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash 97408054, now seen corresponding path program 137 times [2025-04-13 22:17:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:34,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784151162] [2025-04-13 22:17:34,741 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:34,751 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:34,765 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:34,765 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:34,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:35,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:35,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784151162] [2025-04-13 22:17:35,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784151162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:35,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528429654] [2025-04-13 22:17:35,171 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:35,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:35,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:35,172 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:17:35,173 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:17:35,506 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:35,602 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:35,603 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:35,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:35,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:17:35,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:35,720 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:35,721 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 73 treesize of output 45 [2025-04-13 22:17:35,753 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:35,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:35,878 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:35,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 46 treesize of output 83 [2025-04-13 22:17:35,918 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:35,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528429654] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:35,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:35,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2025-04-13 22:17:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665511122] [2025-04-13 22:17:35,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:35,919 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:17:35,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:35,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:17:35,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:17:35,919 INFO L87 Difference]: Start difference. First operand 245 states and 668 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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:17:37,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:37,357 INFO L93 Difference]: Finished difference Result 352 states and 914 transitions. [2025-04-13 22:17:37,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:17:37,357 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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 29 [2025-04-13 22:17:37,357 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:37,358 INFO L225 Difference]: With dead ends: 352 [2025-04-13 22:17:37,358 INFO L226 Difference]: Without dead ends: 344 [2025-04-13 22:17:37,359 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=2041, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:17:37,359 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:37,359 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-04-13 22:17:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 245. [2025-04-13 22:17:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.737704918032787) internal successors, (668), 244 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call 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:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 668 transitions. [2025-04-13 22:17:37,600 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 668 transitions. Word has length 29 [2025-04-13 22:17:37,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:37,600 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 668 transitions. [2025-04-13 22:17:37,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 26 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:17:37,600 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 668 transitions. [2025-04-13 22:17:37,600 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:37,600 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:37,600 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:37,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Forceful destruction successful, exit code 0 [2025-04-13 22:17:37,800 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,SelfDestructingSolverStorable145 [2025-04-13 22:17:37,801 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:17:37,801 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:37,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1005720975, now seen corresponding path program 138 times [2025-04-13 22:17:37,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:37,801 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364849360] [2025-04-13 22:17:37,801 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:37,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:37,811 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:37,828 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:37,828 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:37,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:38,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:38,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364849360] [2025-04-13 22:17:38,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364849360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:38,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715783398] [2025-04-13 22:17:38,155 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:38,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:38,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:38,157 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:17:38,158 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:17:38,497 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:38,526 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:38,526 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:38,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:38,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:17:38,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:38,671 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:17:38,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:38,776 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:38,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 46 treesize of output 83 [2025-04-13 22:17:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:38,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715783398] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:38,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:38,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 25 [2025-04-13 22:17:38,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369560563] [2025-04-13 22:17:38,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:38,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:17:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:38,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:17:38,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:17:38,853 INFO L87 Difference]: Start difference. First operand 245 states and 668 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:17:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:39,754 INFO L93 Difference]: Finished difference Result 304 states and 802 transitions. [2025-04-13 22:17:39,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:17:39,755 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:17:39,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:39,757 INFO L225 Difference]: With dead ends: 304 [2025-04-13 22:17:39,757 INFO L226 Difference]: Without dead ends: 297 [2025-04-13 22:17:39,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:17:39,758 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:39,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:17:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-04-13 22:17:40,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 241. [2025-04-13 22:17:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.716666666666667) internal successors, (652), 240 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call 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,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 652 transitions. [2025-04-13 22:17:40,014 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 652 transitions. Word has length 29 [2025-04-13 22:17:40,014 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:40,014 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 652 transitions. [2025-04-13 22:17:40,014 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:17:40,014 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 652 transitions. [2025-04-13 22:17:40,015 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:40,015 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:40,015 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,025 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:17:40,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2025-04-13 22:17:40,215 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:17:40,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:40,215 INFO L85 PathProgramCache]: Analyzing trace with hash -16095656, now seen corresponding path program 139 times [2025-04-13 22:17:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:40,216 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026501742] [2025-04-13 22:17:40,216 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:40,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:40,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:40,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:40,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:40,707 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:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:40,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026501742] [2025-04-13 22:17:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026501742] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:40,707 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014156305] [2025-04-13 22:17:40,707 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:40,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:40,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:40,709 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:17:40,709 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:17:41,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:41,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:41,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:41,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:41,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:17:41,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:41,146 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:41,146 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 58 treesize of output 34 [2025-04-13 22:17:41,180 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:41,181 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:41,296 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:41,296 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:17:41,335 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:41,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014156305] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:41,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:41,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:17:41,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706234586] [2025-04-13 22:17:41,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:41,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:41,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:41,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:41,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:41,336 INFO L87 Difference]: Start difference. First operand 241 states and 652 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:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:42,603 INFO L93 Difference]: Finished difference Result 311 states and 811 transitions. [2025-04-13 22:17:42,603 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:17:42,603 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:42,603 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:42,604 INFO L225 Difference]: With dead ends: 311 [2025-04-13 22:17:42,604 INFO L226 Difference]: Without dead ends: 297 [2025-04-13 22:17:42,604 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=284, Invalid=2068, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:17:42,604 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:42,605 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-04-13 22:17:42,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 246. [2025-04-13 22:17:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.710204081632653) internal successors, (664), 245 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call 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:42,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 664 transitions. [2025-04-13 22:17:42,858 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 664 transitions. Word has length 29 [2025-04-13 22:17:42,858 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:42,858 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 664 transitions. [2025-04-13 22:17:42,858 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:42,858 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 664 transitions. [2025-04-13 22:17:42,858 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:42,858 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:42,858 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:42,866 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:17:43,058 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2025-04-13 22:17:43,058 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:17:43,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:43,059 INFO L85 PathProgramCache]: Analyzing trace with hash 156907081, now seen corresponding path program 140 times [2025-04-13 22:17:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:43,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241554824] [2025-04-13 22:17:43,059 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:43,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:43,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:43,083 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:43,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:43,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:43,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:43,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241554824] [2025-04-13 22:17:43,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241554824] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:43,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968321319] [2025-04-13 22:17:43,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:43,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:43,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:43,495 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:17:43,496 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:17:43,829 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:43,856 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:43,856 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:43,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:43,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:17:43,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:17:44,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:44,095 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:44,095 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 71 treesize of output 88 [2025-04-13 22:17:44,181 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:44,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968321319] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:44,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:44,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:17:44,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968659693] [2025-04-13 22:17:44,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:44,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:17:44,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:44,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:17:44,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:17:44,181 INFO L87 Difference]: Start difference. First operand 246 states and 664 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:45,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:45,377 INFO L93 Difference]: Finished difference Result 317 states and 808 transitions. [2025-04-13 22:17:45,377 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:17:45,377 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:45,377 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:45,378 INFO L225 Difference]: With dead ends: 317 [2025-04-13 22:17:45,378 INFO L226 Difference]: Without dead ends: 306 [2025-04-13 22:17:45,378 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1819, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:17:45,378 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:45,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:45,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-13 22:17:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 252. [2025-04-13 22:17:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.737051792828685) internal successors, (687), 251 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call 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:45,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 687 transitions. [2025-04-13 22:17:45,641 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 687 transitions. Word has length 29 [2025-04-13 22:17:45,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:45,641 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 687 transitions. [2025-04-13 22:17:45,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:45,641 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 687 transitions. [2025-04-13 22:17:45,641 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:45,641 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:45,641 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:45,649 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:17:45,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable148 [2025-04-13 22:17:45,842 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:17:45,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:45,842 INFO L85 PathProgramCache]: Analyzing trace with hash 11520601, now seen corresponding path program 141 times [2025-04-13 22:17:45,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:45,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030492672] [2025-04-13 22:17:45,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:45,852 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:45,873 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:45,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:17:45,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:46,477 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:17:46,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:46,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030492672] [2025-04-13 22:17:46,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030492672] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:46,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253659831] [2025-04-13 22:17:46,477 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:17:46,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:46,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:46,479 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:17:46,480 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:17:46,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:46,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:46,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:17:46,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:46,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:17:46,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:47,027 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:47,027 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 46 treesize of output 30 [2025-04-13 22:17:47,065 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:17:47,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:47,170 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:17:47,170 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 73 treesize of output 94 [2025-04-13 22:17:47,241 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:17:47,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253659831] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:47,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:47,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 9] total 33 [2025-04-13 22:17:47,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179281529] [2025-04-13 22:17:47,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:47,241 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:17:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:47,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:17:47,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:17:47,242 INFO L87 Difference]: Start difference. First operand 252 states and 687 transitions. Second operand has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 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:48,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:48,303 INFO L93 Difference]: Finished difference Result 303 states and 806 transitions. [2025-04-13 22:17:48,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:17:48,303 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 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:48,303 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:48,304 INFO L225 Difference]: With dead ends: 303 [2025-04-13 22:17:48,304 INFO L226 Difference]: Without dead ends: 296 [2025-04-13 22:17:48,304 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=338, Invalid=2212, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:17:48,304 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:48,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:48,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-04-13 22:17:48,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 244. [2025-04-13 22:17:48,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.728395061728395) internal successors, (663), 243 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call 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:48,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 663 transitions. [2025-04-13 22:17:48,552 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 663 transitions. Word has length 29 [2025-04-13 22:17:48,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:48,552 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 663 transitions. [2025-04-13 22:17:48,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 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:48,553 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 663 transitions. [2025-04-13 22:17:48,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:48,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:48,553 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:48,561 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:17:48,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable149 [2025-04-13 22:17:48,753 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:17:48,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:48,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1101669064, now seen corresponding path program 142 times [2025-04-13 22:17:48,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:48,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937047564] [2025-04-13 22:17:48,754 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:48,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:48,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:48,773 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:48,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:48,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:17:49,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:49,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937047564] [2025-04-13 22:17:49,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937047564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:49,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249137822] [2025-04-13 22:17:49,211 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:17:49,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:49,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:49,212 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:17:49,213 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:17:49,550 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:49,573 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:49,573 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:17:49,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:49,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:17:49,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:49,654 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:17:49,654 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 33 treesize of output 9 [2025-04-13 22:17:49,656 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:17:49,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:49,741 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:49,741 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 44 treesize of output 77 [2025-04-13 22:17:49,781 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:49,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249137822] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:49,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:49,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2025-04-13 22:17:49,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490708398] [2025-04-13 22:17:49,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:49,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:17:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:49,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:17:49,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:17:49,782 INFO L87 Difference]: Start difference. First operand 244 states and 663 transitions. Second operand has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:50,952 INFO L93 Difference]: Finished difference Result 342 states and 887 transitions. [2025-04-13 22:17:50,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:17:50,952 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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:50,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:50,953 INFO L225 Difference]: With dead ends: 342 [2025-04-13 22:17:50,953 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 22:17:50,953 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1995, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:17:50,953 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:50,953 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:50,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 22:17:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 246. [2025-04-13 22:17:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.742857142857143) internal successors, (672), 245 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call 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,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 672 transitions. [2025-04-13 22:17:51,207 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 672 transitions. Word has length 29 [2025-04-13 22:17:51,207 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:51,207 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 672 transitions. [2025-04-13 22:17:51,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.75) internal successors, (49), 28 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:51,207 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 672 transitions. [2025-04-13 22:17:51,207 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:51,207 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:51,208 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,215 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:17:51,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable150 [2025-04-13 22:17:51,408 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:17:51,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash -521155816, now seen corresponding path program 143 times [2025-04-13 22:17:51,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:51,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300449998] [2025-04-13 22:17:51,408 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:51,418 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:51,434 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:51,434 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:51,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:17:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:51,879 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300449998] [2025-04-13 22:17:51,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300449998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:51,880 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167466844] [2025-04-13 22:17:51,880 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:17:51,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:51,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:51,881 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:17:51,882 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:17:52,219 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:52,293 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:52,293 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:17:52,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:52,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 22:17:52,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:52,357 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:52,357 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 81 treesize of output 45 [2025-04-13 22:17:52,383 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:52,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:52,472 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:52,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 71 treesize of output 88 [2025-04-13 22:17:52,541 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:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167466844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:52,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:52,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-04-13 22:17:52,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823751230] [2025-04-13 22:17:52,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:52,542 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:17:52,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:52,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:17:52,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:17:52,542 INFO L87 Difference]: Start difference. First operand 246 states and 672 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) 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:17:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:53,696 INFO L93 Difference]: Finished difference Result 314 states and 834 transitions. [2025-04-13 22:17:53,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:17:53,697 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) 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 29 [2025-04-13 22:17:53,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:53,697 INFO L225 Difference]: With dead ends: 314 [2025-04-13 22:17:53,697 INFO L226 Difference]: Without dead ends: 300 [2025-04-13 22:17:53,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:17:53,698 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:53,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:53,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-04-13 22:17:53,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 242. [2025-04-13 22:17:53,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.7468879668049793) internal successors, (662), 241 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call 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:53,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 662 transitions. [2025-04-13 22:17:53,966 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 662 transitions. Word has length 29 [2025-04-13 22:17:53,966 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:53,966 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 662 transitions. [2025-04-13 22:17:53,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) 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:17:53,966 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 662 transitions. [2025-04-13 22:17:53,966 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:53,966 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:53,966 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:53,975 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:17:54,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,146 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:54,167 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:17:54,167 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1560841979, now seen corresponding path program 144 times [2025-04-13 22:17:54,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:54,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141687626] [2025-04-13 22:17:54,167 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:54,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:54,178 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:54,195 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:54,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:54,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:54,550 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:54,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:54,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141687626] [2025-04-13 22:17:54,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141687626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:54,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763118169] [2025-04-13 22:17:54,550 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:17:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:54,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:54,552 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:17:54,553 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:17:54,897 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:17:54,927 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:54,927 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:17:54,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:54,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:17:54,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:55,087 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:17:55,088 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 65 treesize of output 41 [2025-04-13 22:17:55,110 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:55,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:55,192 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:55,192 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 71 treesize of output 88 [2025-04-13 22:17:55,279 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:55,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763118169] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:55,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:55,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2025-04-13 22:17:55,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535935631] [2025-04-13 22:17:55,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:55,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:17:55,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:55,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:17:55,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:17:55,280 INFO L87 Difference]: Start difference. First operand 242 states and 662 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:17:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:56,668 INFO L93 Difference]: Finished difference Result 357 states and 906 transitions. [2025-04-13 22:17:56,668 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:17:56,669 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:17:56,669 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:56,669 INFO L225 Difference]: With dead ends: 357 [2025-04-13 22:17:56,669 INFO L226 Difference]: Without dead ends: 346 [2025-04-13 22:17:56,670 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=280, Invalid=1790, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:17:56,670 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:56,670 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:17:56,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-04-13 22:17:56,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 246. [2025-04-13 22:17:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.76734693877551) internal successors, (678), 245 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call 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:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 678 transitions. [2025-04-13 22:17:56,925 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 678 transitions. Word has length 29 [2025-04-13 22:17:56,925 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:56,925 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 678 transitions. [2025-04-13 22:17:56,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:17:56,925 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 678 transitions. [2025-04-13 22:17:56,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:56,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:56,925 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:56,933 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:17:57,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152,147 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:57,126 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:17:57,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:57,126 INFO L85 PathProgramCache]: Analyzing trace with hash -987282151, now seen corresponding path program 145 times [2025-04-13 22:17:57,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:57,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012209425] [2025-04-13 22:17:57,126 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:57,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:57,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:57,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:57,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:57,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:17:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:17:57,641 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012209425] [2025-04-13 22:17:57,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012209425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:17:57,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060069491] [2025-04-13 22:17:57,642 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:17:57,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:57,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:17:57,643 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:17:57,644 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:17:57,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:17:58,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:17:58,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:17:58,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:17:58,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:17:58,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:17:58,093 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:58,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:17:58,174 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:17:58,175 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 71 treesize of output 88 [2025-04-13 22:17:58,253 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:58,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060069491] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:17:58,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:17:58,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:17:58,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47798422] [2025-04-13 22:17:58,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:17:58,253 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:17:58,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:17:58,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:17:58,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:17:58,254 INFO L87 Difference]: Start difference. First operand 246 states and 678 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:59,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:17:59,327 INFO L93 Difference]: Finished difference Result 303 states and 776 transitions. [2025-04-13 22:17:59,327 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:17:59,327 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:59,327 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:17:59,328 INFO L225 Difference]: With dead ends: 303 [2025-04-13 22:17:59,328 INFO L226 Difference]: Without dead ends: 292 [2025-04-13 22:17:59,328 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=260, Invalid=2092, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:17:59,329 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:17:59,329 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:17:59,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2025-04-13 22:17:59,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 246. [2025-04-13 22:17:59,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.759183673469388) internal successors, (676), 245 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call 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,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 676 transitions. [2025-04-13 22:17:59,581 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 676 transitions. Word has length 29 [2025-04-13 22:17:59,581 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:17:59,581 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 676 transitions. [2025-04-13 22:17:59,581 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:59,581 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 676 transitions. [2025-04-13 22:17:59,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:17:59,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:17:59,581 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,589 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:17:59,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,148 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:17:59,782 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:17:59,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:17:59,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1530365786, now seen corresponding path program 146 times [2025-04-13 22:17:59,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:17:59,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261304447] [2025-04-13 22:17:59,782 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:17:59,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:17:59,793 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:17:59,804 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:59,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:17:59,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:18:00,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:00,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261304447] [2025-04-13 22:18:00,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261304447] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:00,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051582227] [2025-04-13 22:18:00,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:00,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:00,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:00,249 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:18:00,250 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:18:00,597 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:00,622 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:00,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:00,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:00,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:18:00,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:00,758 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:00,759 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 65 treesize of output 41 [2025-04-13 22:18:00,792 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:18:00,792 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:00,889 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:00,889 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 44 treesize of output 77 [2025-04-13 22:18:00,975 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:18:00,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051582227] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:00,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:00,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:18:00,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805637612] [2025-04-13 22:18:00,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:00,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:18:00,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:00,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:18:00,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:18:00,976 INFO L87 Difference]: Start difference. First operand 246 states and 676 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:02,527 INFO L93 Difference]: Finished difference Result 391 states and 986 transitions. [2025-04-13 22:18:02,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:18:02,527 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:02,527 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:02,528 INFO L225 Difference]: With dead ends: 391 [2025-04-13 22:18:02,528 INFO L226 Difference]: Without dead ends: 383 [2025-04-13 22:18:02,528 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=342, Invalid=2628, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:18:02,529 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:02,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-13 22:18:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 246. [2025-04-13 22:18:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.759183673469388) internal successors, (676), 245 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call 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,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 676 transitions. [2025-04-13 22:18:02,805 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 676 transitions. Word has length 29 [2025-04-13 22:18:02,805 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:02,805 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 676 transitions. [2025-04-13 22:18:02,805 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,805 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 676 transitions. [2025-04-13 22:18:02,805 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:02,805 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:02,805 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,813 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:18:03,006 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154,149 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:03,006 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:18:03,006 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:03,006 INFO L85 PathProgramCache]: Analyzing trace with hash -42520168, now seen corresponding path program 147 times [2025-04-13 22:18:03,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:03,006 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701016779] [2025-04-13 22:18:03,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:03,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:03,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:03,030 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:03,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:03,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:03,304 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:18:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:03,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701016779] [2025-04-13 22:18:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701016779] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:03,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296483966] [2025-04-13 22:18:03,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:03,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:03,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:03,306 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:18:03,307 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:18:03,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:03,694 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:03,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:03,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:03,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:18:03,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:03,870 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:03,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:03,957 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:03,957 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 44 treesize of output 77 [2025-04-13 22:18:04,033 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:18:04,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296483966] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:04,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:04,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 27 [2025-04-13 22:18:04,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036324800] [2025-04-13 22:18:04,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:04,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:18:04,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:04,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:18:04,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:18:04,034 INFO L87 Difference]: Start difference. First operand 246 states and 676 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:18:05,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:05,153 INFO L93 Difference]: Finished difference Result 327 states and 848 transitions. [2025-04-13 22:18:05,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:18:05,153 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:18:05,153 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:05,154 INFO L225 Difference]: With dead ends: 327 [2025-04-13 22:18:05,154 INFO L226 Difference]: Without dead ends: 319 [2025-04-13 22:18:05,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=1565, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:18:05,154 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:05,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:18:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-13 22:18:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 246. [2025-04-13 22:18:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.759183673469388) internal successors, (676), 245 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call 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,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 676 transitions. [2025-04-13 22:18:05,410 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 676 transitions. Word has length 29 [2025-04-13 22:18:05,410 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:05,410 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 676 transitions. [2025-04-13 22:18:05,411 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:18:05,411 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 676 transitions. [2025-04-13 22:18:05,411 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:05,411 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:05,411 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:05,419 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:18:05,611 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,SelfDestructingSolverStorable155 [2025-04-13 22:18:05,611 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:18:05,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1643869496, now seen corresponding path program 148 times [2025-04-13 22:18:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:05,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89901567] [2025-04-13 22:18:05,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:05,622 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:05,634 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:05,634 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:05,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:18:06,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:06,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89901567] [2025-04-13 22:18:06,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89901567] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:06,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117505736] [2025-04-13 22:18:06,120 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:06,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:06,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:06,122 INFO L229 MonitoredProcess]: Starting monitored process 151 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,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Waiting until timeout for monitored process [2025-04-13 22:18:06,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:06,509 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:06,509 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:06,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:18:06,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:06,576 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:06,577 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 58 treesize of output 34 [2025-04-13 22:18:06,611 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:06,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:06,698 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:06,699 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 44 treesize of output 77 [2025-04-13 22:18:06,752 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:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117505736] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:06,752 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:06,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:18:06,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48418256] [2025-04-13 22:18:06,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:06,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:18:06,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:06,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:18:06,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:18:06,753 INFO L87 Difference]: Start difference. First operand 246 states and 676 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:08,040 INFO L93 Difference]: Finished difference Result 343 states and 886 transitions. [2025-04-13 22:18:08,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:18:08,041 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:08,041 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:08,041 INFO L225 Difference]: With dead ends: 343 [2025-04-13 22:18:08,041 INFO L226 Difference]: Without dead ends: 329 [2025-04-13 22:18:08,042 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=2079, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:18:08,042 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:08,042 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-04-13 22:18:08,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 246. [2025-04-13 22:18:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.7510204081632654) internal successors, (674), 245 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call 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:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 674 transitions. [2025-04-13 22:18:08,295 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 674 transitions. Word has length 29 [2025-04-13 22:18:08,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:08,295 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 674 transitions. [2025-04-13 22:18:08,296 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:08,296 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 674 transitions. [2025-04-13 22:18:08,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:08,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:08,296 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:08,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (151)] Ended with exit code 0 [2025-04-13 22:18:08,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 151 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2025-04-13 22:18:08,496 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:18:08,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:08,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1589936085, now seen corresponding path program 149 times [2025-04-13 22:18:08,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:08,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596306557] [2025-04-13 22:18:08,497 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:08,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:08,507 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:08,521 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:08,521 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:08,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:18:08,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:08,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596306557] [2025-04-13 22:18:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596306557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:08,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386481635] [2025-04-13 22:18:08,948 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:08,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:08,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:08,950 INFO L229 MonitoredProcess]: Starting monitored process 152 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:08,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Waiting until timeout for monitored process [2025-04-13 22:18:09,302 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:09,356 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:09,357 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:09,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:09,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:18:09,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:09,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18: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 73 treesize of output 45 [2025-04-13 22:18:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 22:18:09,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:09,598 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:09,598 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 71 treesize of output 88 [2025-04-13 22:18:09,674 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:18:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386481635] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:09,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:09,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-04-13 22:18:09,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247148226] [2025-04-13 22:18:09,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:09,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:18:09,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:09,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:18:09,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:18:09,675 INFO L87 Difference]: Start difference. First operand 246 states and 674 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:10,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:10,882 INFO L93 Difference]: Finished difference Result 342 states and 868 transitions. [2025-04-13 22:18:10,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:18:10,882 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:10,882 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:10,883 INFO L225 Difference]: With dead ends: 342 [2025-04-13 22:18:10,883 INFO L226 Difference]: Without dead ends: 331 [2025-04-13 22:18:10,884 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=1828, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:18:10,884 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:10,884 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:10,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-04-13 22:18:11,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 248. [2025-04-13 22:18:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 2.757085020242915) internal successors, (681), 247 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call 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:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 681 transitions. [2025-04-13 22:18:11,145 INFO L79 Accepts]: Start accepts. Automaton has 248 states and 681 transitions. Word has length 29 [2025-04-13 22:18:11,145 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:11,145 INFO L485 AbstractCegarLoop]: Abstraction has 248 states and 681 transitions. [2025-04-13 22:18:11,145 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:11,145 INFO L278 IsEmpty]: Start isEmpty. Operand 248 states and 681 transitions. [2025-04-13 22:18:11,145 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:11,145 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:11,145 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:11,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (152)] Ended with exit code 0 [2025-04-13 22:18:11,346 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 152 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2025-04-13 22:18:11,346 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:18:11,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:11,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1616253239, now seen corresponding path program 150 times [2025-04-13 22:18:11,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:11,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449908267] [2025-04-13 22:18:11,346 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:11,357 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:11,372 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:11,372 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:11,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:18:11,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:11,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449908267] [2025-04-13 22:18:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449908267] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:11,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682343981] [2025-04-13 22:18:11,831 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:11,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:11,832 INFO L229 MonitoredProcess]: Starting monitored process 153 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,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Waiting until timeout for monitored process [2025-04-13 22:18:12,187 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:12,216 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:12,216 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:12,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:12,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:18:12,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:12,340 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:12,341 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 46 treesize of output 30 [2025-04-13 22:18:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:18:12,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:12,472 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:12,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 71 treesize of output 88 [2025-04-13 22:18:12,539 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:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682343981] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:12,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:12,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:18:12,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172279599] [2025-04-13 22:18:12,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:12,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:18:12,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:12,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:18:12,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:18:12,540 INFO L87 Difference]: Start difference. First operand 248 states and 681 transitions. Second operand has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 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:18:13,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:13,771 INFO L93 Difference]: Finished difference Result 325 states and 851 transitions. [2025-04-13 22:18:13,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:18:13,771 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 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:18:13,772 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:13,772 INFO L225 Difference]: With dead ends: 325 [2025-04-13 22:18:13,772 INFO L226 Difference]: Without dead ends: 318 [2025-04-13 22:18:13,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=1676, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:18:13,773 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:13,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 1220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:18:13,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-04-13 22:18:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 244. [2025-04-13 22:18:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.7613168724279835) internal successors, (671), 243 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call 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,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 671 transitions. [2025-04-13 22:18:14,024 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 671 transitions. Word has length 29 [2025-04-13 22:18:14,024 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:14,024 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 671 transitions. [2025-04-13 22:18:14,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 27 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:18:14,024 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 671 transitions. [2025-04-13 22:18:14,024 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:14,024 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:14,024 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,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (153)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:14,224 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 153 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable158 [2025-04-13 22:18:14,225 INFO L403 AbstractCegarLoop]: === Iteration 160 === 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,225 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:14,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1620412278, now seen corresponding path program 151 times [2025-04-13 22:18:14,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:14,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866734279] [2025-04-13 22:18:14,225 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:14,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:18:14,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:14,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:14,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:14,715 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:18:14,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:14,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866734279] [2025-04-13 22:18:14,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866734279] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:14,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413799304] [2025-04-13 22:18:14,715 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:14,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:14,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:14,717 INFO L229 MonitoredProcess]: Starting monitored process 154 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:14,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2025-04-13 22:18:15,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:18:15,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:15,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:15,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:15,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:18:15,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:15,175 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:15,175 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 58 treesize of output 34 [2025-04-13 22:18:15,209 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:15,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:15,308 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:15,308 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 44 treesize of output 77 [2025-04-13 22:18:15,364 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:15,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413799304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:15,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:15,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:18:15,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672708544] [2025-04-13 22:18:15,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:15,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:18:15,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:15,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:18:15,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:18:15,365 INFO L87 Difference]: Start difference. First operand 244 states and 671 transitions. Second operand has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:16,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:16,727 INFO L93 Difference]: Finished difference Result 365 states and 932 transitions. [2025-04-13 22:18:16,727 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:18:16,727 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:16,727 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:16,728 INFO L225 Difference]: With dead ends: 365 [2025-04-13 22:18:16,728 INFO L226 Difference]: Without dead ends: 357 [2025-04-13 22:18:16,728 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 566 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:18:16,728 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:16,728 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-04-13 22:18:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 244. [2025-04-13 22:18:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.7613168724279835) internal successors, (671), 243 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call 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:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 671 transitions. [2025-04-13 22:18:16,984 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 671 transitions. Word has length 29 [2025-04-13 22:18:16,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:16,984 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 671 transitions. [2025-04-13 22:18:16,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6896551724137931) internal successors, (49), 29 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:16,984 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 671 transitions. [2025-04-13 22:18:16,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:16,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:16,985 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:16,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Ended with exit code 0 [2025-04-13 22:18:17,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159,154 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:17,185 INFO L403 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:17,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:17,185 INFO L85 PathProgramCache]: Analyzing trace with hash 168205355, now seen corresponding path program 152 times [2025-04-13 22:18:17,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:17,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120611330] [2025-04-13 22:18:17,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:17,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:17,196 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:17,211 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:17,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:17,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:18,101 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:18,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:18,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120611330] [2025-04-13 22:18:18,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120611330] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:18,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921752651] [2025-04-13 22:18:18,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:18,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:18,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:18,103 INFO L229 MonitoredProcess]: Starting monitored process 155 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:18,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2025-04-13 22:18:18,466 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:18,492 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:18,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:18,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:18,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:18:18,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:18,626 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:18,626 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 46 treesize of output 30 [2025-04-13 22:18:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:18:18,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:18,771 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:18,771 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 44 treesize of output 77 [2025-04-13 22:18:18,858 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:18,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921752651] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:18,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:18,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 9] total 36 [2025-04-13 22:18:18,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490756520] [2025-04-13 22:18:18,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:18,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:18:18,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:18,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:18:18,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1124, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:18:18,858 INFO L87 Difference]: Start difference. First operand 244 states and 671 transitions. Second operand has 36 states, 36 states have (on average 1.6388888888888888) 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:18:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:20,658 INFO L93 Difference]: Finished difference Result 383 states and 1003 transitions. [2025-04-13 22:18:20,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:18:20,659 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6388888888888888) 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 29 [2025-04-13 22:18:20,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:20,659 INFO L225 Difference]: With dead ends: 383 [2025-04-13 22:18:20,660 INFO L226 Difference]: Without dead ends: 361 [2025-04-13 22:18:20,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=480, Invalid=3680, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:18:20,660 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:20,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:18:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-04-13 22:18:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 256. [2025-04-13 22:18:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.796078431372549) internal successors, (713), 255 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call 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,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 713 transitions. [2025-04-13 22:18:20,930 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 713 transitions. Word has length 29 [2025-04-13 22:18:20,930 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:20,930 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 713 transitions. [2025-04-13 22:18:20,930 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6388888888888888) 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:18:20,930 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 713 transitions. [2025-04-13 22:18:20,931 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:20,931 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:20,931 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,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Ended with exit code 0 [2025-04-13 22:18:21,131 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160,155 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:21,131 INFO L403 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:21,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1506908568, now seen corresponding path program 153 times [2025-04-13 22:18:21,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:21,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755439004] [2025-04-13 22:18:21,132 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:21,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:21,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:21,156 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:21,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:21,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:21,449 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:18:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:21,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755439004] [2025-04-13 22:18:21,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755439004] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:21,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660704402] [2025-04-13 22:18:21,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:21,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:21,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:21,451 INFO L229 MonitoredProcess]: Starting monitored process 156 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:21,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2025-04-13 22:18:21,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:21,841 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:21,841 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:21,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:21,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:18:21,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:21,933 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:21,934 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 65 treesize of output 41 [2025-04-13 22:18:21,955 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:18:21,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:22,034 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:22,034 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 44 treesize of output 77 [2025-04-13 22:18:22,084 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:18:22,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660704402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:22,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:22,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 22:18:22,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678702162] [2025-04-13 22:18:22,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:22,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:18:22,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:22,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:18:22,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:18:22,084 INFO L87 Difference]: Start difference. First operand 256 states and 713 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:18:23,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:23,218 INFO L93 Difference]: Finished difference Result 341 states and 892 transitions. [2025-04-13 22:18:23,218 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:18:23,219 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:18:23,219 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:23,219 INFO L225 Difference]: With dead ends: 341 [2025-04-13 22:18:23,219 INFO L226 Difference]: Without dead ends: 327 [2025-04-13 22:18:23,220 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:18:23,220 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:23,220 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-04-13 22:18:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 256. [2025-04-13 22:18:23,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.788235294117647) internal successors, (711), 255 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call 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,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 711 transitions. [2025-04-13 22:18:23,503 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 711 transitions. Word has length 29 [2025-04-13 22:18:23,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:23,503 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 711 transitions. [2025-04-13 22:18:23,503 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:18:23,503 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 711 transitions. [2025-04-13 22:18:23,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:23,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:23,503 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:23,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:23,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable161,156 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:23,704 INFO L403 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:23,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash 198681548, now seen corresponding path program 154 times [2025-04-13 22:18:23,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:23,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697342302] [2025-04-13 22:18:23,704 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:23,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:23,717 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:23,728 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:23,728 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:23,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:24,208 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:24,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:24,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697342302] [2025-04-13 22:18:24,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697342302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:24,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152961660] [2025-04-13 22:18:24,208 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:24,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:24,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:24,210 INFO L229 MonitoredProcess]: Starting monitored process 157 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,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Waiting until timeout for monitored process [2025-04-13 22:18:24,584 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:24,609 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:24,609 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:24,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:24,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:18:24,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:24,686 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:24,686 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 58 treesize of output 34 [2025-04-13 22:18:24,717 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,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:24,814 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:24,814 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 71 treesize of output 88 [2025-04-13 22:18:24,873 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:24,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152961660] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:24,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:24,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2025-04-13 22:18:24,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015623305] [2025-04-13 22:18:24,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:24,874 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:18:24,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:24,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:18:24,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:18:24,874 INFO L87 Difference]: Start difference. First operand 256 states and 711 transitions. Second operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:18:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:26,151 INFO L93 Difference]: Finished difference Result 346 states and 900 transitions. [2025-04-13 22:18:26,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:18:26,151 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:18:26,151 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:26,152 INFO L225 Difference]: With dead ends: 346 [2025-04-13 22:18:26,152 INFO L226 Difference]: Without dead ends: 336 [2025-04-13 22:18:26,152 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=277, Invalid=1979, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:18:26,153 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:26,153 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:26,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2025-04-13 22:18:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 254. [2025-04-13 22:18:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.774703557312253) internal successors, (702), 253 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call 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:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 702 transitions. [2025-04-13 22:18:26,421 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 702 transitions. Word has length 29 [2025-04-13 22:18:26,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:26,421 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 702 transitions. [2025-04-13 22:18:26,421 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 28 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:18:26,421 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 702 transitions. [2025-04-13 22:18:26,421 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:26,421 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:26,421 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:26,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (157)] Ended with exit code 0 [2025-04-13 22:18:26,621 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,157 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:26,622 INFO L403 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:26,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1534524825, now seen corresponding path program 155 times [2025-04-13 22:18:26,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:26,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693536242] [2025-04-13 22:18:26,622 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:26,633 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:26,647 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:26,648 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:26,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:26,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:26,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693536242] [2025-04-13 22:18:26,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693536242] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:26,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915684466] [2025-04-13 22:18:26,966 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:26,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:26,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:26,968 INFO L229 MonitoredProcess]: Starting monitored process 158 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:26,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Waiting until timeout for monitored process [2025-04-13 22:18:27,343 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:27,563 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:27,564 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:27,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:27,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 22:18:27,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:27,630 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:27,630 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 81 treesize of output 45 [2025-04-13 22:18:27,658 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:27,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:27,748 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:27,749 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 71 treesize of output 88 [2025-04-13 22:18:27,825 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:27,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915684466] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:27,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:27,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2025-04-13 22:18:27,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767382952] [2025-04-13 22:18:27,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:27,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:18:27,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:27,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:18:27,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:18:27,826 INFO L87 Difference]: Start difference. First operand 254 states and 702 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 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:18:28,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:28,904 INFO L93 Difference]: Finished difference Result 313 states and 827 transitions. [2025-04-13 22:18:28,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:18:28,904 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 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:18:28,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:28,905 INFO L225 Difference]: With dead ends: 313 [2025-04-13 22:18:28,905 INFO L226 Difference]: Without dead ends: 306 [2025-04-13 22:18:28,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=194, Invalid=1446, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:18:28,905 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:28,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:28,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-13 22:18:29,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 250. [2025-04-13 22:18:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.7791164658634537) internal successors, (692), 249 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call 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:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 692 transitions. [2025-04-13 22:18:29,173 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 692 transitions. Word has length 29 [2025-04-13 22:18:29,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:29,173 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 692 transitions. [2025-04-13 22:18:29,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 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:18:29,173 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 692 transitions. [2025-04-13 22:18:29,174 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:29,174 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:29,174 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:29,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (158)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:29,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 158 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable163 [2025-04-13 22:18:29,374 INFO L403 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:29,374 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:29,375 INFO L85 PathProgramCache]: Analyzing trace with hash 112794095, now seen corresponding path program 156 times [2025-04-13 22:18:29,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:29,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196246202] [2025-04-13 22:18:29,375 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:29,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:29,386 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:29,400 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:29,401 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:29,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:18:29,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:29,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196246202] [2025-04-13 22:18:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196246202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:29,827 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678956061] [2025-04-13 22:18:29,827 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:29,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:29,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:29,828 INFO L229 MonitoredProcess]: Starting monitored process 159 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,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Waiting until timeout for monitored process [2025-04-13 22:18:30,215 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:30,248 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:30,248 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:30,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:30,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:18:30,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:30,389 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:30,390 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 46 treesize of output 30 [2025-04-13 22:18:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:18:30,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:30,518 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:30,518 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 44 treesize of output 77 [2025-04-13 22:18:30,590 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:18:30,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678956061] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:30,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:30,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:18:30,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685978027] [2025-04-13 22:18:30,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:30,591 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:18:30,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:30,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:18:30,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:18:30,591 INFO L87 Difference]: Start difference. First operand 250 states and 692 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:32,183 INFO L93 Difference]: Finished difference Result 384 states and 996 transitions. [2025-04-13 22:18:32,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:18:32,183 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:32,183 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:32,184 INFO L225 Difference]: With dead ends: 384 [2025-04-13 22:18:32,184 INFO L226 Difference]: Without dead ends: 377 [2025-04-13 22:18:32,184 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=2413, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:18:32,184 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:32,184 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:32,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-04-13 22:18:32,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 246. [2025-04-13 22:18:32,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.742857142857143) internal successors, (672), 245 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call 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:32,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 672 transitions. [2025-04-13 22:18:32,482 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 672 transitions. Word has length 29 [2025-04-13 22:18:32,482 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:32,482 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 672 transitions. [2025-04-13 22:18:32,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:32,482 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 672 transitions. [2025-04-13 22:18:32,482 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:32,482 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:32,482 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:32,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (159)] Ended with exit code 0 [2025-04-13 22:18:32,682 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164,159 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:32,683 INFO L403 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:32,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:32,683 INFO L85 PathProgramCache]: Analyzing trace with hash -975983877, now seen corresponding path program 157 times [2025-04-13 22:18:32,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:32,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955157195] [2025-04-13 22:18:32,683 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:32,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:32,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:18:32,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:32,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:32,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:33,180 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:18:33,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:33,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955157195] [2025-04-13 22:18:33,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955157195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:33,180 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133349364] [2025-04-13 22:18:33,180 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:33,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:33,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:33,182 INFO L229 MonitoredProcess]: Starting monitored process 160 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:33,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2025-04-13 22:18:33,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:18:33,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:33,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:33,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:33,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:18:33,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:33,654 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:33,654 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 58 treesize of output 34 [2025-04-13 22:18:33,689 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:18:33,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:33,788 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:33,788 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 44 treesize of output 77 [2025-04-13 22:18:33,847 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:18:33,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133349364] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:33,847 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:33,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 22:18:33,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788954591] [2025-04-13 22:18:33,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:33,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:18:33,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:33,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:18:33,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:18:33,848 INFO L87 Difference]: Start difference. First operand 246 states and 672 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:18:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:35,370 INFO L93 Difference]: Finished difference Result 365 states and 944 transitions. [2025-04-13 22:18:35,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:18:35,370 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:18:35,370 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:35,371 INFO L225 Difference]: With dead ends: 365 [2025-04-13 22:18:35,371 INFO L226 Difference]: Without dead ends: 343 [2025-04-13 22:18:35,371 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=392, Invalid=2578, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:18:35,371 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:35,371 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-04-13 22:18:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 256. [2025-04-13 22:18:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.764705882352941) internal successors, (705), 255 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call 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:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 705 transitions. [2025-04-13 22:18:35,656 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 705 transitions. Word has length 29 [2025-04-13 22:18:35,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:35,656 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 705 transitions. [2025-04-13 22:18:35,656 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:18:35,656 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 705 transitions. [2025-04-13 22:18:35,656 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:35,656 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:35,656 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:35,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Ended with exit code 0 [2025-04-13 22:18:35,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165,160 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:35,857 INFO L403 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:35,857 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:35,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1831137801, now seen corresponding path program 158 times [2025-04-13 22:18:35,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:35,857 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080424995] [2025-04-13 22:18:35,857 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:35,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:35,868 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:35,884 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:35,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:35,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 22:18:36,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:36,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080424995] [2025-04-13 22:18:36,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080424995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:36,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116149578] [2025-04-13 22:18:36,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:36,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:36,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:36,452 INFO L229 MonitoredProcess]: Starting monitored process 161 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:36,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2025-04-13 22:18:36,842 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:36,867 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:36,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:36,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:36,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:18:36,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:37,034 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:18:37,034 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 25 treesize of output 9 [2025-04-13 22:18:37,046 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:18:37,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:37,135 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:37,135 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 44 treesize of output 77 [2025-04-13 22:18:37,211 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:18:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116149578] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:37,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:37,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 9] total 32 [2025-04-13 22:18:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133072679] [2025-04-13 22:18:37,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:37,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:18:37,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:37,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:18:37,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:18:37,212 INFO L87 Difference]: Start difference. First operand 256 states and 705 transitions. Second operand has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 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:18:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:38,386 INFO L93 Difference]: Finished difference Result 330 states and 880 transitions. [2025-04-13 22:18:38,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:18:38,386 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 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 29 [2025-04-13 22:18:38,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:38,387 INFO L225 Difference]: With dead ends: 330 [2025-04-13 22:18:38,387 INFO L226 Difference]: Without dead ends: 323 [2025-04-13 22:18:38,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=1842, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:18:38,388 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:38,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-04-13 22:18:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 256. [2025-04-13 22:18:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 2.764705882352941) internal successors, (705), 255 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call 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:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 705 transitions. [2025-04-13 22:18:38,660 INFO L79 Accepts]: Start accepts. Automaton has 256 states and 705 transitions. Word has length 29 [2025-04-13 22:18:38,660 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:38,660 INFO L485 AbstractCegarLoop]: Abstraction has 256 states and 705 transitions. [2025-04-13 22:18:38,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.8125) internal successors, (58), 32 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:18:38,660 INFO L278 IsEmpty]: Start isEmpty. Operand 256 states and 705 transitions. [2025-04-13 22:18:38,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:38,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:38,661 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:38,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Ended with exit code 0 [2025-04-13 22:18:38,861 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 161 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable166 [2025-04-13 22:18:38,861 INFO L403 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:38,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:38,861 INFO L85 PathProgramCache]: Analyzing trace with hash -945507684, now seen corresponding path program 159 times [2025-04-13 22:18:38,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:38,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129058163] [2025-04-13 22:18:38,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:38,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:38,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:38,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:38,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:18:38,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:39,904 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:18:39,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:39,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129058163] [2025-04-13 22:18:39,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129058163] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:39,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342092138] [2025-04-13 22:18:39,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:39,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:39,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:39,906 INFO L229 MonitoredProcess]: Starting monitored process 162 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:39,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2025-04-13 22:18:40,302 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:40,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:40,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:18:40,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:40,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:18:40,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:40,537 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:40,538 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 46 treesize of output 30 [2025-04-13 22:18:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:18:40,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:40,690 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:40,690 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 71 treesize of output 88 [2025-04-13 22:18:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:40,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342092138] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:40,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:40,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12, 9] total 38 [2025-04-13 22:18:40,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168174418] [2025-04-13 22:18:40,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:40,787 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:18:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:40,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:18:40,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:18:40,787 INFO L87 Difference]: Start difference. First operand 256 states and 705 transitions. Second operand has 38 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 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:18:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:42,624 INFO L93 Difference]: Finished difference Result 344 states and 863 transitions. [2025-04-13 22:18:42,625 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:18:42,625 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 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 29 [2025-04-13 22:18:42,625 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:42,626 INFO L225 Difference]: With dead ends: 344 [2025-04-13 22:18:42,626 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 22:18:42,626 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=535, Invalid=4295, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 22:18:42,626 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:42,626 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:18:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 22:18:42,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 250. [2025-04-13 22:18:42,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 2.7389558232931726) internal successors, (682), 249 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call 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:42,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 682 transitions. [2025-04-13 22:18:42,901 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 682 transitions. Word has length 29 [2025-04-13 22:18:42,901 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:42,901 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 682 transitions. [2025-04-13 22:18:42,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.736842105263158) internal successors, (66), 38 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:18:42,902 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 682 transitions. [2025-04-13 22:18:42,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:42,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:42,902 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:42,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Ended with exit code 0 [2025-04-13 22:18:43,102 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 162 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable167 [2025-04-13 22:18:43,102 INFO L403 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:43,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2065902139, now seen corresponding path program 160 times [2025-04-13 22:18:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:43,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510890782] [2025-04-13 22:18:43,103 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:43,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:43,114 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:43,126 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:43,126 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:43,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:43,609 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:18:43,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:43,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510890782] [2025-04-13 22:18:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510890782] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:43,609 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93777638] [2025-04-13 22:18:43,609 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:18:43,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:43,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:43,611 INFO L229 MonitoredProcess]: Starting monitored process 163 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:43,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Waiting until timeout for monitored process [2025-04-13 22:18:43,986 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:44,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:44,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:18:44,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:44,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:18:44,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:44,090 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:44,090 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 58 treesize of output 34 [2025-04-13 22:18:44,155 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:44,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:44,292 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:18:44,292 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:44,337 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:44,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [93777638] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:44,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:44,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:18:44,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743487634] [2025-04-13 22:18:44,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:44,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:18:44,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:44,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:18:44,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:18:44,338 INFO L87 Difference]: Start difference. First operand 250 states and 682 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:45,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:45,473 INFO L93 Difference]: Finished difference Result 302 states and 789 transitions. [2025-04-13 22:18:45,473 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:18:45,473 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:45,473 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:45,474 INFO L225 Difference]: With dead ends: 302 [2025-04-13 22:18:45,474 INFO L226 Difference]: Without dead ends: 293 [2025-04-13 22:18:45,474 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:18:45,475 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 867 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:45,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 867 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:45,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-04-13 22:18:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 252. [2025-04-13 22:18:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 251 states have (on average 2.737051792828685) internal successors, (687), 251 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call 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,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 687 transitions. [2025-04-13 22:18:45,757 INFO L79 Accepts]: Start accepts. Automaton has 252 states and 687 transitions. Word has length 29 [2025-04-13 22:18:45,757 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:45,757 INFO L485 AbstractCegarLoop]: Abstraction has 252 states and 687 transitions. [2025-04-13 22:18:45,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:45,758 INFO L278 IsEmpty]: Start isEmpty. Operand 252 states and 687 transitions. [2025-04-13 22:18:45,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:45,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:45,758 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:45,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (163)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:45,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 163 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable168 [2025-04-13 22:18:45,958 INFO L403 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:45,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:45,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1031395137, now seen corresponding path program 161 times [2025-04-13 22:18:45,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:45,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488743492] [2025-04-13 22:18:45,959 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:45,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:45,970 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:45,987 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:45,987 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:45,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:46,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488743492] [2025-04-13 22:18:46,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488743492] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:46,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696957952] [2025-04-13 22:18:46,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:18:46,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:46,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:46,298 INFO L229 MonitoredProcess]: Starting monitored process 164 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,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Waiting until timeout for monitored process [2025-04-13 22:18:46,684 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:46,772 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:46,772 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:18:46,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:46,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:18:46,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:46,835 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:46,836 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 81 treesize of output 45 [2025-04-13 22:18:46,862 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:46,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:46,963 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:46,963 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 44 treesize of output 77 [2025-04-13 22:18:47,018 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:47,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696957952] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:47,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:47,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2025-04-13 22:18:47,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748586696] [2025-04-13 22:18:47,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:47,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:18:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:47,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:18:47,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:18:47,018 INFO L87 Difference]: Start difference. First operand 252 states and 687 transitions. Second operand has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 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:18:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:48,386 INFO L93 Difference]: Finished difference Result 358 states and 933 transitions. [2025-04-13 22:18:48,387 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:18:48,387 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 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:18:48,387 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:48,388 INFO L225 Difference]: With dead ends: 358 [2025-04-13 22:18:48,388 INFO L226 Difference]: Without dead ends: 351 [2025-04-13 22:18:48,388 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=1621, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:18:48,388 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:48,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-04-13 22:18:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 244. [2025-04-13 22:18:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.6872427983539096) internal successors, (653), 243 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call 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:48,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 653 transitions. [2025-04-13 22:18:48,661 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 653 transitions. Word has length 29 [2025-04-13 22:18:48,661 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:48,661 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 653 transitions. [2025-04-13 22:18:48,661 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.8) internal successors, (45), 25 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:18:48,661 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 653 transitions. [2025-04-13 22:18:48,661 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:48,661 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:48,662 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:48,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (164)] Ended with exit code 0 [2025-04-13 22:18:48,862 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 164 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2025-04-13 22:18:48,862 INFO L403 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:48,862 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:48,862 INFO L85 PathProgramCache]: Analyzing trace with hash -2035425946, now seen corresponding path program 162 times [2025-04-13 22:18:48,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:48,862 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780702896] [2025-04-13 22:18:48,862 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:48,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:48,873 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:48,886 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:48,886 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:49,258 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:49,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:49,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780702896] [2025-04-13 22:18:49,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780702896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:49,258 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325099076] [2025-04-13 22:18:49,258 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:18:49,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:49,260 INFO L229 MonitoredProcess]: Starting monitored process 165 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:49,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Waiting until timeout for monitored process [2025-04-13 22:18:49,655 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:49,685 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:49,685 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:18:49,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:49,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:18:49,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:49,877 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:49,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 46 treesize of output 30 [2025-04-13 22:18:49,949 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:49,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:50,088 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:18:50,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 73 treesize of output 94 [2025-04-13 22:18:50,165 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:50,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325099076] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:50,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:50,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 28 [2025-04-13 22:18:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15091447] [2025-04-13 22:18:50,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:50,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:18:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:50,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:18:50,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:18:50,166 INFO L87 Difference]: Start difference. First operand 244 states and 653 transitions. Second operand has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 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:18:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:51,534 INFO L93 Difference]: Finished difference Result 340 states and 863 transitions. [2025-04-13 22:18:51,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:18:51,534 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 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:18:51,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:51,535 INFO L225 Difference]: With dead ends: 340 [2025-04-13 22:18:51,535 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 22:18:51,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:18:51,536 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:51,536 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 0 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:51,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 22:18:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 246. [2025-04-13 22:18:51,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.693877551020408) internal successors, (660), 245 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call 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:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 660 transitions. [2025-04-13 22:18:51,816 INFO L79 Accepts]: Start accepts. Automaton has 246 states and 660 transitions. Word has length 29 [2025-04-13 22:18:51,816 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:51,816 INFO L485 AbstractCegarLoop]: Abstraction has 246 states and 660 transitions. [2025-04-13 22:18:51,816 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 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:18:51,816 INFO L278 IsEmpty]: Start isEmpty. Operand 246 states and 660 transitions. [2025-04-13 22:18:51,816 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:51,816 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:51,816 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:51,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (165)] Ended with exit code 0 [2025-04-13 22:18:52,017 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 165 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable170 [2025-04-13 22:18:52,017 INFO L403 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:52,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash 686948569, now seen corresponding path program 163 times [2025-04-13 22:18:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:52,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808588437] [2025-04-13 22:18:52,017 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:52,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:52,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:18:52,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:52,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:52,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:18:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:52,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808588437] [2025-04-13 22:18:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808588437] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:52,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438330898] [2025-04-13 22:18:52,477 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:18:52,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:52,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:52,479 INFO L229 MonitoredProcess]: Starting monitored process 166 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:52,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Waiting until timeout for monitored process [2025-04-13 22:18:52,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:18:52,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:18:52,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:18:52,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:52,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:18:52,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:52,987 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:18:52,987 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 33 treesize of output 9 [2025-04-13 22:18:52,988 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:52,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:53,075 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:18:53,075 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 44 treesize of output 77 [2025-04-13 22:18:53,128 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:18:53,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438330898] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:53,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:53,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:18:53,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636470934] [2025-04-13 22:18:53,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:53,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:18:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:53,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:18:53,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=708, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:18:53,129 INFO L87 Difference]: Start difference. First operand 246 states and 660 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:54,416 INFO L93 Difference]: Finished difference Result 326 states and 848 transitions. [2025-04-13 22:18:54,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:18:54,416 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:54,416 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:54,417 INFO L225 Difference]: With dead ends: 326 [2025-04-13 22:18:54,417 INFO L226 Difference]: Without dead ends: 319 [2025-04-13 22:18:54,417 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=263, Invalid=1993, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:18:54,417 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 106 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:54,417 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 0 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:18:54,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-13 22:18:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 232. [2025-04-13 22:18:54,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 231 states have (on average 2.6796536796536796) internal successors, (619), 231 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:18:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 619 transitions. [2025-04-13 22:18:54,678 INFO L79 Accepts]: Start accepts. Automaton has 232 states and 619 transitions. Word has length 29 [2025-04-13 22:18:54,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:54,678 INFO L485 AbstractCegarLoop]: Abstraction has 232 states and 619 transitions. [2025-04-13 22:18:54,678 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:18:54,679 INFO L278 IsEmpty]: Start isEmpty. Operand 232 states and 619 transitions. [2025-04-13 22:18:54,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:54,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:54,679 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:54,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (166)] Ended with exit code 0 [2025-04-13 22:18:54,879 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 166 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable171 [2025-04-13 22:18:54,879 INFO L403 AbstractCegarLoop]: === Iteration 173 === 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,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2123994589, now seen corresponding path program 164 times [2025-04-13 22:18:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:54,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749739339] [2025-04-13 22:18:54,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:54,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:54,904 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:54,904 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:54,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:18:55,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:55,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749739339] [2025-04-13 22:18:55,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749739339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:55,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419544463] [2025-04-13 22:18:55,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:18:55,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:55,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:55,322 INFO L229 MonitoredProcess]: Starting monitored process 167 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:55,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Waiting until timeout for monitored process [2025-04-13 22:18:55,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:18:55,738 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:55,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:18:55,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:55,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:18:55,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:55,852 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:55,852 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 65 treesize of output 41 [2025-04-13 22:18:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:18:55,880 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:55,991 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:18:55,992 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:56,054 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:18:56,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419544463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:56,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:56,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:18:56,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880663015] [2025-04-13 22:18:56,054 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:56,055 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:18:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:56,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:18:56,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:18:56,055 INFO L87 Difference]: Start difference. First operand 232 states and 619 transitions. Second operand has 27 states, 27 states have (on average 1.8518518518518519) 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:18:57,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:18:57,140 INFO L93 Difference]: Finished difference Result 286 states and 730 transitions. [2025-04-13 22:18:57,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:18:57,140 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8518518518518519) 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 29 [2025-04-13 22:18:57,141 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:18:57,141 INFO L225 Difference]: With dead ends: 286 [2025-04-13 22:18:57,141 INFO L226 Difference]: Without dead ends: 279 [2025-04-13 22:18:57,142 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=986, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:18:57,142 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:18:57,142 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:18:57,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-04-13 22:18:57,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 224. [2025-04-13 22:18:57,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.6502242152466366) internal successors, (591), 223 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call 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:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 591 transitions. [2025-04-13 22:18:57,401 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 591 transitions. Word has length 29 [2025-04-13 22:18:57,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:18:57,401 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 591 transitions. [2025-04-13 22:18:57,402 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8518518518518519) 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:18:57,402 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 591 transitions. [2025-04-13 22:18:57,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:18:57,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:18:57,402 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:57,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (167)] Forceful destruction successful, exit code 0 [2025-04-13 22:18:57,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 167 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable172 [2025-04-13 22:18:57,602 INFO L403 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:18:57,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:18:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1084875925, now seen corresponding path program 165 times [2025-04-13 22:18:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:18:57,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343484327] [2025-04-13 22:18:57,603 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:18:57,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:57,631 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:57,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:57,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:57,986 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:18:57,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:18:57,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343484327] [2025-04-13 22:18:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343484327] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:18:57,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656772174] [2025-04-13 22:18:57,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:18:57,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:18:57,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:18:57,988 INFO L229 MonitoredProcess]: Starting monitored process 168 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:57,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2025-04-13 22:18:58,387 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:18:58,414 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:58,414 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:18:58,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:18:58,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 22:18:58,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:18:58,581 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:18:58,581 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 65 treesize of output 41 [2025-04-13 22:18:58,612 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:18:58,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:18:58,755 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:18:58,755 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:58,820 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:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656772174] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:18:58,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:18:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 28 [2025-04-13 22:18:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229990842] [2025-04-13 22:18:58,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:18:58,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:18:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:18:58,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:18:58,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=646, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:18:58,821 INFO L87 Difference]: Start difference. First operand 224 states and 591 transitions. Second operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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:19:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:00,344 INFO L93 Difference]: Finished difference Result 337 states and 857 transitions. [2025-04-13 22:19:00,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:19:00,344 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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 29 [2025-04-13 22:19:00,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:00,345 INFO L225 Difference]: With dead ends: 337 [2025-04-13 22:19:00,345 INFO L226 Difference]: Without dead ends: 314 [2025-04-13 22:19:00,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=1918, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:19:00,346 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:00,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-04-13 22:19:00,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 242. [2025-04-13 22:19:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.6970954356846475) internal successors, (650), 241 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call 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:00,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 650 transitions. [2025-04-13 22:19:00,624 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 650 transitions. Word has length 29 [2025-04-13 22:19:00,624 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:00,624 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 650 transitions. [2025-04-13 22:19:00,624 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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:19:00,624 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 650 transitions. [2025-04-13 22:19:00,624 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:00,624 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:00,624 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:19:00,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Ended with exit code 0 [2025-04-13 22:19:00,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,168 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:00,825 INFO L403 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:00,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1289460480, now seen corresponding path program 166 times [2025-04-13 22:19:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:00,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924644341] [2025-04-13 22:19:00,825 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:00,836 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:00,845 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:00,845 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:00,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:01,345 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:19:01,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:01,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924644341] [2025-04-13 22:19:01,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924644341] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:01,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070318618] [2025-04-13 22:19:01,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:01,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:01,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:01,347 INFO L229 MonitoredProcess]: Starting monitored process 169 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:01,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2025-04-13 22:19:01,741 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:01,766 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:01,766 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:01,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:01,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 22:19:01,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:01,913 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:19:01,913 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 58 treesize of output 31 [2025-04-13 22:19:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:01,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:02,102 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:19:02,103 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 73 treesize of output 94 [2025-04-13 22:19:02,179 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:19:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070318618] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:02,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:02,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10] total 34 [2025-04-13 22:19:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126248246] [2025-04-13 22:19:02,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:02,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:19:02,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:02,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:19:02,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:19:02,180 INFO L87 Difference]: Start difference. First operand 242 states and 650 transitions. Second operand has 34 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 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:19:03,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:03,363 INFO L93 Difference]: Finished difference Result 274 states and 712 transitions. [2025-04-13 22:19:03,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:19:03,363 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 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:19:03,363 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:03,364 INFO L225 Difference]: With dead ends: 274 [2025-04-13 22:19:03,364 INFO L226 Difference]: Without dead ends: 260 [2025-04-13 22:19:03,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 431 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=276, Invalid=2076, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:19:03,365 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:03,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:03,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2025-04-13 22:19:03,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 242. [2025-04-13 22:19:03,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 241 states have (on average 2.6887966804979255) internal successors, (648), 241 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:19:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 648 transitions. [2025-04-13 22:19:03,645 INFO L79 Accepts]: Start accepts. Automaton has 242 states and 648 transitions. Word has length 29 [2025-04-13 22:19:03,645 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:03,645 INFO L485 AbstractCegarLoop]: Abstraction has 242 states and 648 transitions. [2025-04-13 22:19:03,645 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 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:19:03,645 INFO L278 IsEmpty]: Start isEmpty. Operand 242 states and 648 transitions. [2025-04-13 22:19:03,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:03,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:03,645 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:19:03,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Ended with exit code 0 [2025-04-13 22:19:03,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174,169 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:03,845 INFO L403 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:03,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1029464665, now seen corresponding path program 167 times [2025-04-13 22:19:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:03,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851348266] [2025-04-13 22:19:03,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:03,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:03,857 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:03,872 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:03,872 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:03,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:19:04,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:04,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851348266] [2025-04-13 22:19:04,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851348266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:04,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115225453] [2025-04-13 22:19:04,277 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:04,279 INFO L229 MonitoredProcess]: Starting monitored process 170 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:04,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2025-04-13 22:19:04,671 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:04,774 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:04,774 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:04,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:04,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:19:04,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:04,887 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:04,887 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 73 treesize of output 45 [2025-04-13 22:19:04,918 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:19:04,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:05,047 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:19:05,047 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:19:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:05,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115225453] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:05,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:05,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2025-04-13 22:19:05,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227640141] [2025-04-13 22:19:05,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:05,098 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:19:05,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:05,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:19:05,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:19:05,098 INFO L87 Difference]: Start difference. First operand 242 states and 648 transitions. Second operand has 26 states, 26 states have (on average 1.8461538461538463) 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:19:06,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:06,595 INFO L93 Difference]: Finished difference Result 337 states and 854 transitions. [2025-04-13 22:19:06,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:19:06,595 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8461538461538463) 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 29 [2025-04-13 22:19:06,595 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:06,596 INFO L225 Difference]: With dead ends: 337 [2025-04-13 22:19:06,596 INFO L226 Difference]: Without dead ends: 330 [2025-04-13 22:19:06,596 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:19:06,596 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 131 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 850 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 850 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:06,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 0 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 850 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:06,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-04-13 22:19:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 230. [2025-04-13 22:19:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 2.6550218340611353) internal successors, (608), 229 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call 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,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 608 transitions. [2025-04-13 22:19:06,856 INFO L79 Accepts]: Start accepts. Automaton has 230 states and 608 transitions. Word has length 29 [2025-04-13 22:19:06,856 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:06,856 INFO L485 AbstractCegarLoop]: Abstraction has 230 states and 608 transitions. [2025-04-13 22:19:06,856 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8461538461538463) 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:19:06,856 INFO L278 IsEmpty]: Start isEmpty. Operand 230 states and 608 transitions. [2025-04-13 22:19:06,857 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:06,857 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:06,857 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:19:06,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Ended with exit code 0 [2025-04-13 22:19:07,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175,170 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:07,057 INFO L403 AbstractCegarLoop]: === Iteration 177 === 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,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash -402969693, now seen corresponding path program 168 times [2025-04-13 22:19:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:07,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328804222] [2025-04-13 22:19:07,058 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:07,069 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:07,083 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:07,084 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:19:07,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:07,411 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:19:07,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:07,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328804222] [2025-04-13 22:19:07,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328804222] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:07,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342478551] [2025-04-13 22:19:07,411 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:07,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:07,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:07,413 INFO L229 MonitoredProcess]: Starting monitored process 171 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,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2025-04-13 22:19:07,806 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:07,840 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:07,840 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:19:07,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:07,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:19:07,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:07,947 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:19:07,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:08,040 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:19:08,040 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:19:08,091 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:19:08,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342478551] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:08,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:08,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 22:19:08,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142648725] [2025-04-13 22:19:08,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:08,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 22:19:08,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:08,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 22:19:08,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2025-04-13 22:19:08,092 INFO L87 Difference]: Start difference. First operand 230 states and 608 transitions. Second operand has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:19:08,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:08,998 INFO L93 Difference]: Finished difference Result 287 states and 737 transitions. [2025-04-13 22:19:08,998 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:19:08,998 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:19:08,998 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:08,999 INFO L225 Difference]: With dead ends: 287 [2025-04-13 22:19:08,999 INFO L226 Difference]: Without dead ends: 280 [2025-04-13 22:19:08,999 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:19:08,999 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:08,999 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2025-04-13 22:19:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2025-04-13 22:19:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.6695278969957084) internal successors, (622), 233 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call 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:09,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 622 transitions. [2025-04-13 22:19:09,273 INFO L79 Accepts]: Start accepts. Automaton has 234 states and 622 transitions. Word has length 29 [2025-04-13 22:19:09,273 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:09,273 INFO L485 AbstractCegarLoop]: Abstraction has 234 states and 622 transitions. [2025-04-13 22:19:09,273 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 23 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:19:09,273 INFO L278 IsEmpty]: Start isEmpty. Operand 234 states and 622 transitions. [2025-04-13 22:19:09,273 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:09,273 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:09,273 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:19:09,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Ended with exit code 0 [2025-04-13 22:19:09,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable176,171 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:09,474 INFO L403 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:09,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:09,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1547158925, now seen corresponding path program 169 times [2025-04-13 22:19:09,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:09,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247414069] [2025-04-13 22:19:09,474 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:09,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:19:09,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:09,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:09,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:19:09,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:09,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247414069] [2025-04-13 22:19:09,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247414069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:09,946 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395699334] [2025-04-13 22:19:09,946 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:09,947 INFO L229 MonitoredProcess]: Starting monitored process 172 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:09,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2025-04-13 22:19:10,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:19:10,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:10,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:10,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:10,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:19:10,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:10,468 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:19:10,468 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 33 treesize of output 9 [2025-04-13 22:19:10,469 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:19:10,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:10,575 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:19:10,575 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:19:10,621 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:10,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395699334] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:10,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:10,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 22:19:10,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889141970] [2025-04-13 22:19:10,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:10,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:19:10,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:10,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:19:10,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:19:10,622 INFO L87 Difference]: Start difference. First operand 234 states and 622 transitions. Second operand has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:19:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:11,926 INFO L93 Difference]: Finished difference Result 312 states and 803 transitions. [2025-04-13 22:19:11,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:19:11,926 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:19:11,926 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:11,927 INFO L225 Difference]: With dead ends: 312 [2025-04-13 22:19:11,927 INFO L226 Difference]: Without dead ends: 305 [2025-04-13 22:19:11,927 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=292, Invalid=2060, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:19:11,927 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:11,927 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-04-13 22:19:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 228. [2025-04-13 22:19:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 2.656387665198238) internal successors, (603), 227 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call 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:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 603 transitions. [2025-04-13 22:19:12,197 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 603 transitions. Word has length 29 [2025-04-13 22:19:12,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:12,197 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 603 transitions. [2025-04-13 22:19:12,198 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.6551724137931034) internal successors, (48), 29 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:19:12,198 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 603 transitions. [2025-04-13 22:19:12,198 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:12,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:12,198 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:19:12,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Ended with exit code 0 [2025-04-13 22:19:12,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 172 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable177 [2025-04-13 22:19:12,398 INFO L403 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:12,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:12,399 INFO L85 PathProgramCache]: Analyzing trace with hash -415719800, now seen corresponding path program 170 times [2025-04-13 22:19:12,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:12,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943213235] [2025-04-13 22:19:12,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:12,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:12,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:12,422 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:12,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:12,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:12,833 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:19:12,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:12,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943213235] [2025-04-13 22:19:12,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943213235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:12,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140707669] [2025-04-13 22:19:12,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:12,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:12,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:12,835 INFO L229 MonitoredProcess]: Starting monitored process 173 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:12,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2025-04-13 22:19:13,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:13,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:13,273 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:13,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:13,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:19:13,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:19:13,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:13,519 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:19:13,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 73 treesize of output 94 [2025-04-13 22:19:13,593 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:19:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140707669] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:13,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:13,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 26 [2025-04-13 22:19:13,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604026452] [2025-04-13 22:19:13,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:13,594 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:19:13,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:13,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:19:13,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:19:13,594 INFO L87 Difference]: Start difference. First operand 228 states and 603 transitions. Second operand has 26 states, 26 states have (on average 2.0) 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:19:14,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:14,488 INFO L93 Difference]: Finished difference Result 259 states and 665 transitions. [2025-04-13 22:19:14,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:19:14,488 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) 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 29 [2025-04-13 22:19:14,488 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:14,488 INFO L225 Difference]: With dead ends: 259 [2025-04-13 22:19:14,489 INFO L226 Difference]: Without dead ends: 242 [2025-04-13 22:19:14,489 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:19:14,489 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:14,489 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-04-13 22:19:14,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 226. [2025-04-13 22:19:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 2.648888888888889) internal successors, (596), 225 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call 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:14,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 596 transitions. [2025-04-13 22:19:14,747 INFO L79 Accepts]: Start accepts. Automaton has 226 states and 596 transitions. Word has length 29 [2025-04-13 22:19:14,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:14,747 INFO L485 AbstractCegarLoop]: Abstraction has 226 states and 596 transitions. [2025-04-13 22:19:14,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) 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:19:14,747 INFO L278 IsEmpty]: Start isEmpty. Operand 226 states and 596 transitions. [2025-04-13 22:19:14,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:14,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:14,747 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:19:14,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Ended with exit code 0 [2025-04-13 22:19:14,947 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable178,173 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:14,948 INFO L403 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:14,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 181888409, now seen corresponding path program 171 times [2025-04-13 22:19:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:14,948 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997582301] [2025-04-13 22:19:14,948 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:14,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:14,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:14,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:14,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:19:14,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:15,337 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:15,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:15,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997582301] [2025-04-13 22:19:15,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997582301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:15,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21773290] [2025-04-13 22:19:15,337 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:15,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:15,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:15,339 INFO L229 MonitoredProcess]: Starting monitored process 174 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:15,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2025-04-13 22:19:15,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:15,792 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:15,792 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:19:15,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:15,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:19:15,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:15,897 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:19:15,898 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 25 treesize of output 9 [2025-04-13 22:19:15,907 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:19:15,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:15,997 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:19:15,997 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:19:16,038 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:16,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21773290] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:16,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:16,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 25 [2025-04-13 22:19:16,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703138554] [2025-04-13 22:19:16,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:16,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:19:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:16,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:19:16,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:19:16,039 INFO L87 Difference]: Start difference. First operand 226 states and 596 transitions. Second operand has 25 states, 25 states have (on average 2.08) 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:19:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:17,060 INFO L93 Difference]: Finished difference Result 300 states and 772 transitions. [2025-04-13 22:19:17,060 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:19:17,060 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) 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 29 [2025-04-13 22:19:17,060 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:17,061 INFO L225 Difference]: With dead ends: 300 [2025-04-13 22:19:17,061 INFO L226 Difference]: Without dead ends: 293 [2025-04-13 22:19:17,061 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=967, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:19:17,061 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:17,061 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-04-13 22:19:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 224. [2025-04-13 22:19:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.6412556053811658) internal successors, (589), 223 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call 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:17,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 589 transitions. [2025-04-13 22:19:17,327 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 589 transitions. Word has length 29 [2025-04-13 22:19:17,327 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:17,327 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 589 transitions. [2025-04-13 22:19:17,327 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) 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:19:17,327 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 589 transitions. [2025-04-13 22:19:17,327 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:17,327 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:17,327 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:19:17,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Ended with exit code 0 [2025-04-13 22:19:17,527 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 174 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable179 [2025-04-13 22:19:17,528 INFO L403 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:17,528 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1326077641, now seen corresponding path program 172 times [2025-04-13 22:19:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:17,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492795110] [2025-04-13 22:19:17,528 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:17,540 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:17,552 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:17,552 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:17,995 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:19:17,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:17,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492795110] [2025-04-13 22:19:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492795110] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:17,995 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784101790] [2025-04-13 22:19:17,995 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:17,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:17,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:17,997 INFO L229 MonitoredProcess]: Starting monitored process 175 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:17,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2025-04-13 22:19:18,419 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:18,443 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:18,443 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:18,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:18,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:19:18,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:18,528 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:19:18,528 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 33 treesize of output 9 [2025-04-13 22:19:18,529 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:19:18,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:18,634 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:19:18,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 46 treesize of output 83 [2025-04-13 22:19:18,664 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:19:18,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784101790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:18,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:18,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2025-04-13 22:19:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531032964] [2025-04-13 22:19:18,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:18,665 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:19:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:18,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:19:18,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:19:18,665 INFO L87 Difference]: Start difference. First operand 224 states and 589 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:19:19,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:19,546 INFO L93 Difference]: Finished difference Result 264 states and 677 transitions. [2025-04-13 22:19:19,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:19:19,546 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:19:19,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:19,547 INFO L225 Difference]: With dead ends: 264 [2025-04-13 22:19:19,547 INFO L226 Difference]: Without dead ends: 257 [2025-04-13 22:19:19,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:19:19,548 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:19,548 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:19,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2025-04-13 22:19:19,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 218. [2025-04-13 22:19:19,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.6267281105990783) internal successors, (570), 217 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call 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:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 570 transitions. [2025-04-13 22:19:19,807 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 570 transitions. Word has length 29 [2025-04-13 22:19:19,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:19,807 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 570 transitions. [2025-04-13 22:19:19,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:19:19,807 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 570 transitions. [2025-04-13 22:19:19,807 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:19,807 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:19,807 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:19:19,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Ended with exit code 0 [2025-04-13 22:19:20,008 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 175 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable180 [2025-04-13 22:19:20,008 INFO L403 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:20,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:20,008 INFO L85 PathProgramCache]: Analyzing trace with hash 788585025, now seen corresponding path program 173 times [2025-04-13 22:19:20,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:20,008 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271388515] [2025-04-13 22:19:20,008 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:20,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:20,021 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:20,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:20,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:20,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:19:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:20,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271388515] [2025-04-13 22:19:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271388515] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:20,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502495214] [2025-04-13 22:19:20,396 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:20,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:20,397 INFO L229 MonitoredProcess]: Starting monitored process 176 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:20,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2025-04-13 22:19:20,814 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:20,880 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:20,880 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:20,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:20,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 22:19:20,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:21,002 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:21,003 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 73 treesize of output 45 [2025-04-13 22:19:21,031 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:21,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:21,151 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:19:21,151 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 36 treesize of output 52 [2025-04-13 22:19:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:21,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502495214] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:21,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:21,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 26 [2025-04-13 22:19:21,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503540393] [2025-04-13 22:19:21,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:21,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:19:21,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:21,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:19:21,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:19:21,168 INFO L87 Difference]: Start difference. First operand 218 states and 570 transitions. Second operand has 26 states, 26 states have (on average 1.8461538461538463) 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:19:22,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:22,219 INFO L93 Difference]: Finished difference Result 294 states and 731 transitions. [2025-04-13 22:19:22,220 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:19:22,220 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8461538461538463) 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 29 [2025-04-13 22:19:22,220 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:22,221 INFO L225 Difference]: With dead ends: 294 [2025-04-13 22:19:22,221 INFO L226 Difference]: Without dead ends: 285 [2025-04-13 22:19:22,221 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=1122, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:19:22,221 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 120 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:22,221 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 0 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-04-13 22:19:22,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 224. [2025-04-13 22:19:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.6502242152466366) internal successors, (591), 223 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call 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:22,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 591 transitions. [2025-04-13 22:19:22,488 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 591 transitions. Word has length 29 [2025-04-13 22:19:22,488 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:22,488 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 591 transitions. [2025-04-13 22:19:22,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8461538461538463) 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:19:22,488 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 591 transitions. [2025-04-13 22:19:22,488 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:22,488 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:22,488 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:19:22,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Ended with exit code 0 [2025-04-13 22:19:22,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181,176 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:22,689 INFO L403 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:22,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:22,689 INFO L85 PathProgramCache]: Analyzing trace with hash 648600392, now seen corresponding path program 174 times [2025-04-13 22:19:22,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:22,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647414767] [2025-04-13 22:19:22,689 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:22,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:22,701 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:22,718 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:22,718 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:19:22,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:23,115 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:19:23,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:23,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647414767] [2025-04-13 22:19:23,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647414767] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:23,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768006448] [2025-04-13 22:19:23,116 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:23,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:23,118 INFO L229 MonitoredProcess]: Starting monitored process 177 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:23,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2025-04-13 22:19:23,533 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:23,563 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:23,563 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:19:23,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:23,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:19:23,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:23,741 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:23,742 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 65 treesize of output 41 [2025-04-13 22:19:23,770 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:19:23,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:23,897 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:19:23,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 67 treesize of output 71 [2025-04-13 22:19:23,949 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:23,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768006448] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:23,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:23,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 26 [2025-04-13 22:19:23,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857647838] [2025-04-13 22:19:23,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:23,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:19:23,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:23,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:19:23,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:19:23,950 INFO L87 Difference]: Start difference. First operand 224 states and 591 transitions. Second operand has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:19:25,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:25,498 INFO L93 Difference]: Finished difference Result 289 states and 732 transitions. [2025-04-13 22:19:25,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:19:25,498 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:19:25,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:25,499 INFO L225 Difference]: With dead ends: 289 [2025-04-13 22:19:25,499 INFO L226 Difference]: Without dead ends: 281 [2025-04-13 22:19:25,499 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=1435, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:19:25,500 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:25,500 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 0 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:25,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-04-13 22:19:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 224. [2025-04-13 22:19:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.6502242152466366) internal successors, (591), 223 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call 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:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 591 transitions. [2025-04-13 22:19:25,777 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 591 transitions. Word has length 29 [2025-04-13 22:19:25,777 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:25,777 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 591 transitions. [2025-04-13 22:19:25,777 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 26 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:19:25,777 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 591 transitions. [2025-04-13 22:19:25,777 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:25,777 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:25,777 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:19:25,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Ended with exit code 0 [2025-04-13 22:19:25,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,177 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:25,978 INFO L403 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:25,978 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:25,978 INFO L85 PathProgramCache]: Analyzing trace with hash 705557508, now seen corresponding path program 175 times [2025-04-13 22:19:25,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:25,978 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563924134] [2025-04-13 22:19:25,978 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:25,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:25,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:19:26,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:26,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:26,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:19:26,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:26,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563924134] [2025-04-13 22:19:26,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563924134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:26,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [47230969] [2025-04-13 22:19:26,567 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:26,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:26,569 INFO L229 MonitoredProcess]: Starting monitored process 178 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:26,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2025-04-13 22:19:26,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:19:27,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:27,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:27,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:27,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:19:27,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:27,120 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:27,120 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 58 treesize of output 34 [2025-04-13 22:19:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:27,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:27,388 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:19:27,388 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 67 treesize of output 71 [2025-04-13 22:19:27,401 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:19:27,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [47230969] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:27,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:27,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 10] total 31 [2025-04-13 22:19:27,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657065506] [2025-04-13 22:19:27,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:27,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:19:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:27,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:19:27,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=828, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:19:27,402 INFO L87 Difference]: Start difference. First operand 224 states and 591 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) 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:19:28,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:28,891 INFO L93 Difference]: Finished difference Result 284 states and 715 transitions. [2025-04-13 22:19:28,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:19:28,892 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) 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 29 [2025-04-13 22:19:28,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:28,893 INFO L225 Difference]: With dead ends: 284 [2025-04-13 22:19:28,893 INFO L226 Difference]: Without dead ends: 273 [2025-04-13 22:19:28,893 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=269, Invalid=1801, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:19:28,893 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:28,893 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-04-13 22:19:29,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 224. [2025-04-13 22:19:29,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 2.6412556053811658) internal successors, (589), 223 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call 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,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 589 transitions. [2025-04-13 22:19:29,175 INFO L79 Accepts]: Start accepts. Automaton has 224 states and 589 transitions. Word has length 29 [2025-04-13 22:19:29,175 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:29,175 INFO L485 AbstractCegarLoop]: Abstraction has 224 states and 589 transitions. [2025-04-13 22:19:29,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6774193548387097) 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:19:29,175 INFO L278 IsEmpty]: Start isEmpty. Operand 224 states and 589 transitions. [2025-04-13 22:19:29,176 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:29,176 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:29,176 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:19:29,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:29,376 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183,178 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:29,376 INFO L403 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:29,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:29,376 INFO L85 PathProgramCache]: Analyzing trace with hash 562712939, now seen corresponding path program 176 times [2025-04-13 22:19:29,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:29,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142640363] [2025-04-13 22:19:29,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:29,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:29,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:29,402 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:29,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:29,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:19:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:29,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142640363] [2025-04-13 22:19:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142640363] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:29,823 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535448890] [2025-04-13 22:19:29,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:29,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:29,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:29,825 INFO L229 MonitoredProcess]: Starting monitored process 179 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:29,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2025-04-13 22:19:30,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:30,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:30,290 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:30,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:30,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:19:30,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:30,402 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:30,402 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 65 treesize of output 41 [2025-04-13 22:19:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:19:30,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:30,545 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:19:30,545 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 36 treesize of output 52 [2025-04-13 22:19:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535448890] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:30,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:30,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 26 [2025-04-13 22:19:30,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152066830] [2025-04-13 22:19:30,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:30,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:19:30,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:19:30,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:19:30,573 INFO L87 Difference]: Start difference. First operand 224 states and 589 transitions. Second operand has 26 states, 26 states have (on average 1.8076923076923077) 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:19:31,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:31,748 INFO L93 Difference]: Finished difference Result 298 states and 740 transitions. [2025-04-13 22:19:31,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:19:31,749 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.8076923076923077) 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 29 [2025-04-13 22:19:31,749 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:31,750 INFO L225 Difference]: With dead ends: 298 [2025-04-13 22:19:31,750 INFO L226 Difference]: Without dead ends: 291 [2025-04-13 22:19:31,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:19:31,750 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:31,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:31,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-04-13 22:19:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 218. [2025-04-13 22:19:32,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.6175115207373274) internal successors, (568), 217 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call 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:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 568 transitions. [2025-04-13 22:19:32,022 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 568 transitions. Word has length 29 [2025-04-13 22:19:32,022 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:32,022 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 568 transitions. [2025-04-13 22:19:32,022 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.8076923076923077) 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:19:32,022 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 568 transitions. [2025-04-13 22:19:32,022 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:32,022 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:32,022 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:19:32,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Ended with exit code 0 [2025-04-13 22:19:32,222 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184,179 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:32,223 INFO L403 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:32,223 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1565026684, now seen corresponding path program 177 times [2025-04-13 22:19:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:32,223 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891984996] [2025-04-13 22:19:32,223 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:32,235 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:32,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 22:19:32,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:19:32,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:32,607 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:32,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:32,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891984996] [2025-04-13 22:19:32,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891984996] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:32,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368792842] [2025-04-13 22:19:32,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:32,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:32,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:32,609 INFO L229 MonitoredProcess]: Starting monitored process 180 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:32,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2025-04-13 22:19:33,039 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:33,061 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 22:19:33,061 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 22:19:33,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:33,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:19:33,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:33,275 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:33,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:33,397 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:19:33,397 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 67 treesize of output 71 [2025-04-13 22:19:33,439 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:33,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368792842] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:33,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:33,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 27 [2025-04-13 22:19:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905112171] [2025-04-13 22:19:33,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:33,439 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:19:33,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:33,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:19:33,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:19:33,440 INFO L87 Difference]: Start difference. First operand 218 states and 568 transitions. Second operand has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:19:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:34,685 INFO L93 Difference]: Finished difference Result 273 states and 675 transitions. [2025-04-13 22:19:34,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:19:34,685 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:19:34,685 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:34,686 INFO L225 Difference]: With dead ends: 273 [2025-04-13 22:19:34,686 INFO L226 Difference]: Without dead ends: 259 [2025-04-13 22:19:34,686 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:19:34,686 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:34,686 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:34,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-04-13 22:19:34,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 218. [2025-04-13 22:19:34,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.608294930875576) internal successors, (566), 217 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call 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:34,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 566 transitions. [2025-04-13 22:19:34,949 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 566 transitions. Word has length 29 [2025-04-13 22:19:34,949 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:34,949 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 566 transitions. [2025-04-13 22:19:34,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8888888888888888) internal successors, (51), 27 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:19:34,949 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 566 transitions. [2025-04-13 22:19:34,950 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:34,950 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:34,950 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:19:34,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Ended with exit code 0 [2025-04-13 22:19:35,150 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185,180 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:35,150 INFO L403 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:35,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:35,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2013910651, now seen corresponding path program 178 times [2025-04-13 22:19:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:35,151 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587309674] [2025-04-13 22:19:35,151 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:35,162 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:35,174 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:35,174 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:35,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:35,632 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:19:35,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:35,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587309674] [2025-04-13 22:19:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587309674] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:35,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997913426] [2025-04-13 22:19:35,632 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:35,634 INFO L229 MonitoredProcess]: Starting monitored process 181 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:35,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Waiting until timeout for monitored process [2025-04-13 22:19:36,046 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:36,070 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:36,071 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:36,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:36,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:19:36,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:36,181 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:19:36,181 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 33 treesize of output 9 [2025-04-13 22:19:36,183 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:19:36,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:36,302 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:19:36,303 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 36 treesize of output 52 [2025-04-13 22:19:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:36,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997913426] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:36,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:36,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 28 [2025-04-13 22:19:36,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954613002] [2025-04-13 22:19:36,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:36,313 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:19:36,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:36,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:19:36,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:19:36,313 INFO L87 Difference]: Start difference. First operand 218 states and 566 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:19:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:37,578 INFO L93 Difference]: Finished difference Result 294 states and 728 transitions. [2025-04-13 22:19:37,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:19:37,578 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:19:37,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:37,579 INFO L225 Difference]: With dead ends: 294 [2025-04-13 22:19:37,579 INFO L226 Difference]: Without dead ends: 287 [2025-04-13 22:19:37,579 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=1552, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:19:37,579 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:37,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-04-13 22:19:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 218. [2025-04-13 22:19:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.6175115207373274) internal successors, (568), 217 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call 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:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 568 transitions. [2025-04-13 22:19:37,854 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 568 transitions. Word has length 29 [2025-04-13 22:19:37,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:37,854 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 568 transitions. [2025-04-13 22:19:37,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 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:19:37,854 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 568 transitions. [2025-04-13 22:19:37,854 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:37,854 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:37,854 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:19:37,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (181)] Ended with exit code 0 [2025-04-13 22:19:38,054 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable186,181 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:38,055 INFO L403 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:38,055 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:38,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1856199932, now seen corresponding path program 179 times [2025-04-13 22:19:38,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:38,055 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866554828] [2025-04-13 22:19:38,055 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:38,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:38,067 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:38,084 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:38,085 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:38,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:38,451 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:19:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:38,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866554828] [2025-04-13 22:19:38,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866554828] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:38,451 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231775830] [2025-04-13 22:19:38,451 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:38,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:38,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:38,453 INFO L229 MonitoredProcess]: Starting monitored process 182 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:38,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Waiting until timeout for monitored process [2025-04-13 22:19:38,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:38,923 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:38,923 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:38,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:38,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:19:38,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:39,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:39,162 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:19:39,162 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 67 treesize of output 71 [2025-04-13 22:19:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:39,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231775830] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:39,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:39,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 9] total 24 [2025-04-13 22:19:39,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261791993] [2025-04-13 22:19:39,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:39,184 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 22:19:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:39,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 22:19:39,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2025-04-13 22:19:39,185 INFO L87 Difference]: Start difference. First operand 218 states and 568 transitions. Second operand has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 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:19:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:40,188 INFO L93 Difference]: Finished difference Result 276 states and 680 transitions. [2025-04-13 22:19:40,188 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 22:19:40,188 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 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:19:40,188 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:40,189 INFO L225 Difference]: With dead ends: 276 [2025-04-13 22:19:40,189 INFO L226 Difference]: Without dead ends: 259 [2025-04-13 22:19:40,189 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:19:40,189 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:40,189 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:40,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-04-13 22:19:40,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 218. [2025-04-13 22:19:40,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 217 states have (on average 2.608294930875576) internal successors, (566), 217 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call 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:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 566 transitions. [2025-04-13 22:19:40,458 INFO L79 Accepts]: Start accepts. Automaton has 218 states and 566 transitions. Word has length 29 [2025-04-13 22:19:40,458 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:40,458 INFO L485 AbstractCegarLoop]: Abstraction has 218 states and 566 transitions. [2025-04-13 22:19:40,458 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9583333333333333) internal successors, (47), 24 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:19:40,458 INFO L278 IsEmpty]: Start isEmpty. Operand 218 states and 566 transitions. [2025-04-13 22:19:40,458 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:40,458 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:40,458 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:19:40,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (182)] Ended with exit code 0 [2025-04-13 22:19:40,658 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 182 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable187 [2025-04-13 22:19:40,659 INFO L403 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:40,659 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash -284863317, now seen corresponding path program 180 times [2025-04-13 22:19:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:40,659 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280229089] [2025-04-13 22:19:40,659 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:40,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:40,671 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:40,691 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:40,691 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:19:40,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:19:41,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:41,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280229089] [2025-04-13 22:19:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280229089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:41,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699807232] [2025-04-13 22:19:41,215 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:19:41,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:41,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:41,217 INFO L229 MonitoredProcess]: Starting monitored process 183 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:41,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Waiting until timeout for monitored process [2025-04-13 22:19:41,664 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 22:19:41,694 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:41,694 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:19:41,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:41,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 22:19:41,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:41,799 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:19:41,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:41,898 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:19:41,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 36 treesize of output 52 [2025-04-13 22:19:41,923 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:41,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699807232] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:41,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:41,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11, 9] total 28 [2025-04-13 22:19:41,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264723065] [2025-04-13 22:19:41,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:41,923 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 22:19:41,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:41,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 22:19:41,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2025-04-13 22:19:41,924 INFO L87 Difference]: Start difference. First operand 218 states and 566 transitions. Second operand has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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:19:43,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:43,029 INFO L93 Difference]: Finished difference Result 294 states and 728 transitions. [2025-04-13 22:19:43,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:19:43,029 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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 29 [2025-04-13 22:19:43,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:43,030 INFO L225 Difference]: With dead ends: 294 [2025-04-13 22:19:43,030 INFO L226 Difference]: Without dead ends: 287 [2025-04-13 22:19:43,030 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:19:43,030 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:43,030 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-04-13 22:19:43,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 216. [2025-04-13 22:19:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.609302325581395) internal successors, (561), 215 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call 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,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 561 transitions. [2025-04-13 22:19:43,301 INFO L79 Accepts]: Start accepts. Automaton has 216 states and 561 transitions. Word has length 29 [2025-04-13 22:19:43,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:43,301 INFO L485 AbstractCegarLoop]: Abstraction has 216 states and 561 transitions. [2025-04-13 22:19:43,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 28 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:19:43,301 INFO L278 IsEmpty]: Start isEmpty. Operand 216 states and 561 transitions. [2025-04-13 22:19:43,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:43,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:43,302 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:19:43,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (183)] Ended with exit code 0 [2025-04-13 22:19:43,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188,183 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:43,502 INFO L403 AbstractCegarLoop]: === Iteration 190 === 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,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:43,502 INFO L85 PathProgramCache]: Analyzing trace with hash 949362368, now seen corresponding path program 181 times [2025-04-13 22:19:43,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:43,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290912435] [2025-04-13 22:19:43,503 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:43,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:43,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:19:43,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:43,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:43,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:19:44,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:44,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290912435] [2025-04-13 22:19:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290912435] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:44,033 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710312061] [2025-04-13 22:19:44,033 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:19:44,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:44,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:44,035 INFO L229 MonitoredProcess]: Starting monitored process 184 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,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Waiting until timeout for monitored process [2025-04-13 22:19:44,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 22:19:44,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:44,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:19:44,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:44,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 22:19:44,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:44,589 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 22:19:44,589 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 34 treesize of output 19 [2025-04-13 22:19:44,603 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:44,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:44,807 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:19:44,808 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 67 treesize of output 71 [2025-04-13 22:19:44,821 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:19:44,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710312061] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:44,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:44,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 10] total 31 [2025-04-13 22:19:44,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775635232] [2025-04-13 22:19:44,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:44,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:19:44,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:44,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:19:44,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:19:44,822 INFO L87 Difference]: Start difference. First operand 216 states and 561 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) 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:19:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:46,028 INFO L93 Difference]: Finished difference Result 257 states and 646 transitions. [2025-04-13 22:19:46,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:19:46,028 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) 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 29 [2025-04-13 22:19:46,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:46,029 INFO L225 Difference]: With dead ends: 257 [2025-04-13 22:19:46,029 INFO L226 Difference]: Without dead ends: 235 [2025-04-13 22:19:46,029 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=257, Invalid=1635, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 22:19:46,029 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:46,029 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:19:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-04-13 22:19:46,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 211. [2025-04-13 22:19:46,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 210 states have (on average 2.619047619047619) internal successors, (550), 210 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call 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:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 550 transitions. [2025-04-13 22:19:46,304 INFO L79 Accepts]: Start accepts. Automaton has 211 states and 550 transitions. Word has length 29 [2025-04-13 22:19:46,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:46,304 INFO L485 AbstractCegarLoop]: Abstraction has 211 states and 550 transitions. [2025-04-13 22:19:46,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6774193548387097) 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:19:46,304 INFO L278 IsEmpty]: Start isEmpty. Operand 211 states and 550 transitions. [2025-04-13 22:19:46,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 22:19:46,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:46,304 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:19:46,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (184)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:46,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 184 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable189 [2025-04-13 22:19:46,505 INFO L403 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:46,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:46,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1029565815, now seen corresponding path program 182 times [2025-04-13 22:19:46,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:46,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557922489] [2025-04-13 22:19:46,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:46,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:46,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:46,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:46,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:46,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:19:46,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:46,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557922489] [2025-04-13 22:19:46,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557922489] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:46,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113613794] [2025-04-13 22:19:46,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:19:46,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:46,953 INFO L229 MonitoredProcess]: Starting monitored process 185 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:46,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2025-04-13 22:19:47,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 22:19:47,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 22:19:47,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:19:47,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:47,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:19:47,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:47,576 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:19: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 25 treesize of output 9 [2025-04-13 22:19:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 22:19:47,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:47,706 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:19:47,706 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 36 treesize of output 52 [2025-04-13 22:19:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:19:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113613794] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:47,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:47,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 27 [2025-04-13 22:19:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130096055] [2025-04-13 22:19:47,754 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:47,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 22:19:47,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:47,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 22:19:47,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-04-13 22:19:47,754 INFO L87 Difference]: Start difference. First operand 211 states and 550 transitions. Second operand has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:19:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:48,757 INFO L93 Difference]: Finished difference Result 268 states and 678 transitions. [2025-04-13 22:19:48,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:19:48,757 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:19:48,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:48,758 INFO L225 Difference]: With dead ends: 268 [2025-04-13 22:19:48,758 INFO L226 Difference]: Without dead ends: 261 [2025-04-13 22:19:48,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=1019, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:19:48,758 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:48,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:19:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-04-13 22:19:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 207. [2025-04-13 22:19:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.6019417475728157) internal successors, (536), 206 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:19:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 536 transitions. [2025-04-13 22:19:49,019 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 536 transitions. Word has length 29 [2025-04-13 22:19:49,019 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:49,019 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 536 transitions. [2025-04-13 22:19:49,019 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.9259259259259258) internal successors, (52), 27 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:19:49,019 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 536 transitions. [2025-04-13 22:19:49,019 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:19:49,019 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:49,019 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:49,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Ended with exit code 0 [2025-04-13 22:19:49,221 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 185 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable190 [2025-04-13 22:19:49,221 INFO L403 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:49,221 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:49,221 INFO L85 PathProgramCache]: Analyzing trace with hash 2060320803, now seen corresponding path program 183 times [2025-04-13 22:19:49,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:49,221 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552516634] [2025-04-13 22:19:49,221 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:49,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:49,233 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:49,247 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:49,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:49,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:49,614 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:49,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:49,614 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552516634] [2025-04-13 22:19:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552516634] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:49,615 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596828023] [2025-04-13 22:19:49,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:19:49,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:49,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:49,616 INFO L229 MonitoredProcess]: Starting monitored process 186 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:49,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2025-04-13 22:19:50,048 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:50,079 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:50,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:19:50,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:50,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:19:50,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:50,166 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:50,166 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 27 treesize of output 19 [2025-04-13 22:19:50,187 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:50,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:50,469 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:19:50,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 134 treesize of output 83 [2025-04-13 22:19:50,519 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:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596828023] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:50,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:50,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 28 [2025-04-13 22:19:50,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941334015] [2025-04-13 22:19:50,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:50,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:19:50,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:50,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:19:50,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:19:50,520 INFO L87 Difference]: Start difference. First operand 207 states and 536 transitions. Second operand has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 29 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:19:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:51,867 INFO L93 Difference]: Finished difference Result 311 states and 775 transitions. [2025-04-13 22:19:51,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:19:51,867 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 29 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:19:51,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:51,868 INFO L225 Difference]: With dead ends: 311 [2025-04-13 22:19:51,868 INFO L226 Difference]: Without dead ends: 306 [2025-04-13 22:19:51,869 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=1215, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:19:51,869 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:51,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:19:51,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-13 22:19:52,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 221. [2025-04-13 22:19:52,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 2.631818181818182) internal successors, (579), 220 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call 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:52,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 579 transitions. [2025-04-13 22:19:52,166 INFO L79 Accepts]: Start accepts. Automaton has 221 states and 579 transitions. Word has length 30 [2025-04-13 22:19:52,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:52,166 INFO L485 AbstractCegarLoop]: Abstraction has 221 states and 579 transitions. [2025-04-13 22:19:52,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.8214285714285714) internal successors, (51), 29 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:19:52,166 INFO L278 IsEmpty]: Start isEmpty. Operand 221 states and 579 transitions. [2025-04-13 22:19:52,166 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:19:52,166 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:52,166 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:52,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Ended with exit code 0 [2025-04-13 22:19:52,366 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable191,186 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:52,367 INFO L403 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:52,367 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1021766889, now seen corresponding path program 184 times [2025-04-13 22:19:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:52,367 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848306902] [2025-04-13 22:19:52,367 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:52,379 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:19:52,391 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:19:52,391 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:52,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:19:52,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:52,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848306902] [2025-04-13 22:19:52,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848306902] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:52,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515219453] [2025-04-13 22:19:52,962 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:19:52,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:52,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:52,964 INFO L229 MonitoredProcess]: Starting monitored process 187 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:52,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2025-04-13 22:19:53,391 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:19:53,416 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:19:53,416 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:19:53,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:53,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:19:53,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:53,538 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:53,539 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 35 treesize of output 23 [2025-04-13 22:19:53,568 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:53,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:53,895 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:19:53,895 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 181 treesize of output 113 [2025-04-13 22:19:53,995 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:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515219453] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:53,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:53,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:19:53,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68215634] [2025-04-13 22:19:53,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:53,996 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:19:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:53,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:19:53,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:19:53,996 INFO L87 Difference]: Start difference. First operand 221 states and 579 transitions. Second operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:19:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:55,739 INFO L93 Difference]: Finished difference Result 310 states and 792 transitions. [2025-04-13 22:19:55,739 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:19:55,739 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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 30 [2025-04-13 22:19:55,739 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:55,740 INFO L225 Difference]: With dead ends: 310 [2025-04-13 22:19:55,740 INFO L226 Difference]: Without dead ends: 301 [2025-04-13 22:19:55,740 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=397, Invalid=3385, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:19:55,741 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:55,741 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 0 Invalid, 1432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:19:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-04-13 22:19:56,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 239. [2025-04-13 22:19:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.630252100840336) internal successors, (626), 238 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call 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:56,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 626 transitions. [2025-04-13 22:19:56,085 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 626 transitions. Word has length 30 [2025-04-13 22:19:56,086 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:19:56,086 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 626 transitions. [2025-04-13 22:19:56,086 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:19:56,086 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 626 transitions. [2025-04-13 22:19:56,086 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:19:56,086 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:19:56,086 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:56,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Forceful destruction successful, exit code 0 [2025-04-13 22:19:56,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,187 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:56,286 INFO L403 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:19:56,287 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:19:56,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1070135011, now seen corresponding path program 185 times [2025-04-13 22:19:56,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:19:56,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788441360] [2025-04-13 22:19:56,287 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:56,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:19:56,299 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:56,327 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:56,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:56,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:19:57,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:19:57,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788441360] [2025-04-13 22:19:57,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788441360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:19:57,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440978278] [2025-04-13 22:19:57,169 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:19:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:19:57,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:19:57,171 INFO L229 MonitoredProcess]: Starting monitored process 188 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:57,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2025-04-13 22:19:57,606 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:19:57,653 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:57,653 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:19:57,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:19:57,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:19:57,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:19:57,951 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:19:57,951 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 27 treesize of output 19 [2025-04-13 22:19:57,991 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:19:57,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:19:58,359 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:19:58,359 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 181 treesize of output 113 [2025-04-13 22:19:58,420 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:19:58,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440978278] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:19:58,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:19:58,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 11] total 44 [2025-04-13 22:19:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325666777] [2025-04-13 22:19:58,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:19:58,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 22:19:58,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:19:58,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 22:19:58,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1829, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:19:58,421 INFO L87 Difference]: Start difference. First operand 239 states and 626 transitions. Second operand has 45 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 45 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:19:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:19:59,936 INFO L93 Difference]: Finished difference Result 304 states and 772 transitions. [2025-04-13 22:19:59,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:19:59,936 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 45 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:19:59,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:19:59,937 INFO L225 Difference]: With dead ends: 304 [2025-04-13 22:19:59,937 INFO L226 Difference]: Without dead ends: 299 [2025-04-13 22:19:59,937 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=266, Invalid=2596, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:19:59,937 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 87 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:19:59,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 0 Invalid, 1496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:19:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-04-13 22:20:00,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 239. [2025-04-13 22:20:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 2.630252100840336) internal successors, (626), 238 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call 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:00,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 626 transitions. [2025-04-13 22:20:00,287 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 626 transitions. Word has length 30 [2025-04-13 22:20:00,288 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:00,288 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 626 transitions. [2025-04-13 22:20:00,288 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 45 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:20:00,288 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 626 transitions. [2025-04-13 22:20:00,288 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:00,288 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:00,288 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:00,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Ended with exit code 0 [2025-04-13 22:20:00,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 188 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable193 [2025-04-13 22:20:00,488 INFO L403 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:00,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:00,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1770220497, now seen corresponding path program 186 times [2025-04-13 22:20:00,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:00,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813651943] [2025-04-13 22:20:00,489 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:00,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:00,509 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:00,525 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:00,525 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:00,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:01,058 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:20:01,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:01,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813651943] [2025-04-13 22:20:01,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813651943] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:01,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093998801] [2025-04-13 22:20:01,059 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:01,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:01,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:01,060 INFO L229 MonitoredProcess]: Starting monitored process 189 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:01,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2025-04-13 22:20:01,520 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:01,554 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:01,554 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:01,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:20:01,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:01,691 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:01,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 27 treesize of output 19 [2025-04-13 22:20:01,718 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:01,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:02,037 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:20:02,037 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 181 treesize of output 113 [2025-04-13 22:20:02,130 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:02,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093998801] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:02,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:02,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 33 [2025-04-13 22:20:02,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514229726] [2025-04-13 22:20:02,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:02,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:20:02,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:02,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:20:02,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:20:02,131 INFO L87 Difference]: Start difference. First operand 239 states and 626 transitions. Second operand has 34 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 34 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:20:04,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:04,132 INFO L93 Difference]: Finished difference Result 328 states and 821 transitions. [2025-04-13 22:20:04,132 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:20:04,132 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 34 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:20:04,132 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:04,133 INFO L225 Difference]: With dead ends: 328 [2025-04-13 22:20:04,133 INFO L226 Difference]: Without dead ends: 319 [2025-04-13 22:20:04,134 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 708 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=326, Invalid=2754, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:20:04,134 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1596 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:04,134 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:20:04,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-04-13 22:20:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 245. [2025-04-13 22:20:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.651639344262295) internal successors, (647), 244 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call 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:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 647 transitions. [2025-04-13 22:20:04,503 INFO L79 Accepts]: Start accepts. Automaton has 245 states and 647 transitions. Word has length 30 [2025-04-13 22:20:04,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:04,503 INFO L485 AbstractCegarLoop]: Abstraction has 245 states and 647 transitions. [2025-04-13 22:20:04,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 34 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:20:04,503 INFO L278 IsEmpty]: Start isEmpty. Operand 245 states and 647 transitions. [2025-04-13 22:20:04,503 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:04,503 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:04,503 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:04,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:04,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194,189 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:04,704 INFO L403 AbstractCegarLoop]: === Iteration 196 === 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,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:04,704 INFO L85 PathProgramCache]: Analyzing trace with hash -640478297, now seen corresponding path program 187 times [2025-04-13 22:20:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:04,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992698851] [2025-04-13 22:20:04,704 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:04,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:04,732 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,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:04,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:20:05,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:05,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992698851] [2025-04-13 22:20:05,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992698851] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:05,295 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212741844] [2025-04-13 22:20:05,295 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:05,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:05,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:05,297 INFO L229 MonitoredProcess]: Starting monitored process 190 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:05,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Waiting until timeout for monitored process [2025-04-13 22:20:05,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:05,769 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,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:05,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:05,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:20:05,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:05,881 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:05,881 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 35 treesize of output 23 [2025-04-13 22:20:05,910 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:20:05,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:06,245 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:20:06,246 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 181 treesize of output 113 [2025-04-13 22:20:06,307 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:20:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212741844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:06,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2025-04-13 22:20:06,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832258410] [2025-04-13 22:20:06,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:06,308 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:20:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:06,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:20:06,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:20:06,308 INFO L87 Difference]: Start difference. First operand 245 states and 647 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:07,929 INFO L93 Difference]: Finished difference Result 314 states and 795 transitions. [2025-04-13 22:20:07,929 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:20:07,930 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:07,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:07,930 INFO L225 Difference]: With dead ends: 314 [2025-04-13 22:20:07,930 INFO L226 Difference]: Without dead ends: 309 [2025-04-13 22:20:07,931 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=2163, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:20:07,931 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:07,931 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:20:07,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-04-13 22:20:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 243. [2025-04-13 22:20:08,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 242 states have (on average 2.644628099173554) internal successors, (640), 242 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call 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:08,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 640 transitions. [2025-04-13 22:20:08,285 INFO L79 Accepts]: Start accepts. Automaton has 243 states and 640 transitions. Word has length 30 [2025-04-13 22:20:08,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:08,285 INFO L485 AbstractCegarLoop]: Abstraction has 243 states and 640 transitions. [2025-04-13 22:20:08,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:08,285 INFO L278 IsEmpty]: Start isEmpty. Operand 243 states and 640 transitions. [2025-04-13 22:20:08,285 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:08,285 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:08,285 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:08,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Ended with exit code 0 [2025-04-13 22:20:08,486 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable195,190 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:08,486 INFO L403 AbstractCegarLoop]: === Iteration 197 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:08,486 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:08,486 INFO L85 PathProgramCache]: Analyzing trace with hash 52471437, now seen corresponding path program 188 times [2025-04-13 22:20:08,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:08,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265184712] [2025-04-13 22:20:08,486 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:08,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:08,511 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:08,511 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:08,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:09,027 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:20:09,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:09,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265184712] [2025-04-13 22:20:09,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265184712] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:09,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291613465] [2025-04-13 22:20:09,028 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:09,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:09,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:09,029 INFO L229 MonitoredProcess]: Starting monitored process 191 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:09,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process [2025-04-13 22:20:09,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:09,508 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:09,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:09,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:09,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:20:09,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:09,624 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:09,625 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 27 treesize of output 19 [2025-04-13 22:20:09,649 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:20:09,649 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:09,965 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:20:09,965 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 181 treesize of output 113 [2025-04-13 22:20:10,058 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:10,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291613465] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:10,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:10,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 32 [2025-04-13 22:20:10,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891080843] [2025-04-13 22:20:10,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:10,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:20:10,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:10,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:20:10,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:20:10,059 INFO L87 Difference]: Start difference. First operand 243 states and 640 transitions. Second operand has 33 states, 32 states have (on average 1.75) internal successors, (56), 33 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:20:11,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:11,814 INFO L93 Difference]: Finished difference Result 326 states and 826 transitions. [2025-04-13 22:20:11,814 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:20:11,814 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.75) internal successors, (56), 33 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:20:11,814 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:11,815 INFO L225 Difference]: With dead ends: 326 [2025-04-13 22:20:11,815 INFO L226 Difference]: Without dead ends: 317 [2025-04-13 22:20:11,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=296, Invalid=2254, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:20:11,816 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:11,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:20:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2025-04-13 22:20:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 251. [2025-04-13 22:20:12,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 2.68) internal successors, (670), 250 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call 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,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 670 transitions. [2025-04-13 22:20:12,208 INFO L79 Accepts]: Start accepts. Automaton has 251 states and 670 transitions. Word has length 30 [2025-04-13 22:20:12,208 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:12,208 INFO L485 AbstractCegarLoop]: Abstraction has 251 states and 670 transitions. [2025-04-13 22:20:12,208 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.75) internal successors, (56), 33 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:20:12,208 INFO L278 IsEmpty]: Start isEmpty. Operand 251 states and 670 transitions. [2025-04-13 22:20:12,209 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:12,209 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:12,209 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,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Ended with exit code 0 [2025-04-13 22:20:12,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable196,191 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:12,409 INFO L403 AbstractCegarLoop]: === Iteration 198 === 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,409 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:12,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1936739939, now seen corresponding path program 189 times [2025-04-13 22:20:12,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:12,410 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303405610] [2025-04-13 22:20:12,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:12,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:12,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:20:12,437 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:20:12,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:12,809 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:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:12,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303405610] [2025-04-13 22:20:12,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303405610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:12,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902988805] [2025-04-13 22:20:12,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:12,811 INFO L229 MonitoredProcess]: Starting monitored process 192 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,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Waiting until timeout for monitored process [2025-04-13 22:20:13,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:13,282 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:20:13,282 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:20:13,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:13,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:20:13,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:13,452 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:20:13,452 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 27 treesize of output 15 [2025-04-13 22:20:13,476 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:13,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:13,695 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:13,696 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 152 treesize of output 134 [2025-04-13 22:20:14,020 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:14,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902988805] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:14,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:14,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 22:20:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001871050] [2025-04-13 22:20:14,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:14,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:20:14,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:14,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:20:14,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=778, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:20:14,021 INFO L87 Difference]: Start difference. First operand 251 states and 670 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:20:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:15,310 INFO L93 Difference]: Finished difference Result 316 states and 808 transitions. [2025-04-13 22:20:15,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:20:15,310 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:20:15,310 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:15,311 INFO L225 Difference]: With dead ends: 316 [2025-04-13 22:20:15,311 INFO L226 Difference]: Without dead ends: 311 [2025-04-13 22:20:15,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:20:15,312 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:15,312 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:20:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-04-13 22:20:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 247. [2025-04-13 22:20:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 2.6666666666666665) internal successors, (656), 246 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call 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:15,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 656 transitions. [2025-04-13 22:20:15,674 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 656 transitions. Word has length 30 [2025-04-13 22:20:15,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:15,674 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 656 transitions. [2025-04-13 22:20:15,674 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:20:15,674 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 656 transitions. [2025-04-13 22:20:15,674 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:15,674 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:15,674 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:15,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Ended with exit code 0 [2025-04-13 22:20:15,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable197,192 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:15,875 INFO L403 AbstractCegarLoop]: === Iteration 199 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:15,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2939823, now seen corresponding path program 190 times [2025-04-13 22:20:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:15,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359004883] [2025-04-13 22:20:15,875 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:15,888 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:15,901 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:15,902 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:15,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:16,595 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:20:16,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:16,595 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359004883] [2025-04-13 22:20:16,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359004883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:16,596 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425464545] [2025-04-13 22:20:16,596 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:16,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:16,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:16,597 INFO L229 MonitoredProcess]: Starting monitored process 193 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:16,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Waiting until timeout for monitored process [2025-04-13 22:20:17,040 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:17,065 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:17,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:17,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:17,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:20:17,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:17,176 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:17,176 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 35 treesize of output 23 [2025-04-13 22:20:17,222 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:17,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:17,571 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:20:17,571 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 181 treesize of output 113 [2025-04-13 22:20:17,675 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:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425464545] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:17,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:17,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:20:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40594714] [2025-04-13 22:20:17,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:17,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:20:17,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:17,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:20:17,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:20:17,676 INFO L87 Difference]: Start difference. First operand 247 states and 656 transitions. Second operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:20:19,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:19,897 INFO L93 Difference]: Finished difference Result 333 states and 848 transitions. [2025-04-13 22:20:19,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:20:19,897 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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 30 [2025-04-13 22:20:19,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:19,899 INFO L225 Difference]: With dead ends: 333 [2025-04-13 22:20:19,899 INFO L226 Difference]: Without dead ends: 320 [2025-04-13 22:20:19,899 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=432, Invalid=3728, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:20:19,899 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:19,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:20:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-04-13 22:20:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 247. [2025-04-13 22:20:20,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 246 states have (on average 2.6666666666666665) internal successors, (656), 246 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call 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,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 656 transitions. [2025-04-13 22:20:20,274 INFO L79 Accepts]: Start accepts. Automaton has 247 states and 656 transitions. Word has length 30 [2025-04-13 22:20:20,274 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:20,274 INFO L485 AbstractCegarLoop]: Abstraction has 247 states and 656 transitions. [2025-04-13 22:20:20,274 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:20:20,274 INFO L278 IsEmpty]: Start isEmpty. Operand 247 states and 656 transitions. [2025-04-13 22:20:20,275 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:20,275 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:20,275 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:20,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:20,475 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable198,193 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:20,475 INFO L403 AbstractCegarLoop]: === Iteration 200 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:20,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:20,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1881328679, now seen corresponding path program 191 times [2025-04-13 22:20:20,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:20,476 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248018657] [2025-04-13 22:20:20,476 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:20,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:20,490 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:20,512 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:20,513 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:20,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:20:21,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:21,228 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248018657] [2025-04-13 22:20:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248018657] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:21,229 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373098665] [2025-04-13 22:20:21,229 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:21,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:21,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:21,230 INFO L229 MonitoredProcess]: Starting monitored process 194 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:21,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (194)] Waiting until timeout for monitored process [2025-04-13 22:20:21,685 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:21,733 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:21,733 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:21,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:20:21,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:21,938 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:21,938 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 31 treesize of output 23 [2025-04-13 22:20:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:20:21,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:22,347 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:20:22,347 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 181 treesize of output 113 [2025-04-13 22:20:22,413 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:20:22,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373098665] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:22,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:22,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 11] total 40 [2025-04-13 22:20:22,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919718655] [2025-04-13 22:20:22,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:22,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 22:20:22,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:22,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 22:20:22,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1501, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:20:22,414 INFO L87 Difference]: Start difference. First operand 247 states and 656 transitions. Second operand has 41 states, 40 states have (on average 1.65) internal successors, (66), 41 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:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:24,155 INFO L93 Difference]: Finished difference Result 308 states and 784 transitions. [2025-04-13 22:20:24,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:20:24,156 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 41 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:24,156 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:24,157 INFO L225 Difference]: With dead ends: 308 [2025-04-13 22:20:24,157 INFO L226 Difference]: Without dead ends: 303 [2025-04-13 22:20:24,157 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=2489, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:20:24,157 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1679 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:24,157 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1679 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:20:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-04-13 22:20:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 241. [2025-04-13 22:20:24,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 240 states have (on average 2.6458333333333335) internal successors, (635), 240 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call 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:24,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 635 transitions. [2025-04-13 22:20:24,505 INFO L79 Accepts]: Start accepts. Automaton has 241 states and 635 transitions. Word has length 30 [2025-04-13 22:20:24,505 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:24,505 INFO L485 AbstractCegarLoop]: Abstraction has 241 states and 635 transitions. [2025-04-13 22:20:24,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.65) internal successors, (66), 41 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:24,505 INFO L278 IsEmpty]: Start isEmpty. Operand 241 states and 635 transitions. [2025-04-13 22:20:24,506 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:24,506 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:24,506 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:24,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (194)] Ended with exit code 0 [2025-04-13 22:20:24,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 194 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable199 [2025-04-13 22:20:24,706 INFO L403 AbstractCegarLoop]: === Iteration 201 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:24,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:24,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1153100683, now seen corresponding path program 192 times [2025-04-13 22:20:24,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:24,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309630517] [2025-04-13 22:20:24,707 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:24,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:24,718 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:24,743 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:24,743 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:24,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:25,232 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:20:25,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:25,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309630517] [2025-04-13 22:20:25,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309630517] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:25,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774950356] [2025-04-13 22:20:25,232 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:25,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:25,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:25,234 INFO L229 MonitoredProcess]: Starting monitored process 195 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:25,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Waiting until timeout for monitored process [2025-04-13 22:20:25,704 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:25,754 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:25,754 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:25,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:25,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:20:25,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:25,888 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:20:25,888 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 27 treesize of output 15 [2025-04-13 22:20:25,897 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:25,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:26,046 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:26,046 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 148 treesize of output 128 [2025-04-13 22:20:26,276 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:26,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774950356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:26,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:26,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 31 [2025-04-13 22:20:26,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347685307] [2025-04-13 22:20:26,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:26,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:20:26,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:26,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:20:26,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:20:26,277 INFO L87 Difference]: Start difference. First operand 241 states and 635 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:20:27,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:27,792 INFO L93 Difference]: Finished difference Result 317 states and 796 transitions. [2025-04-13 22:20:27,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:20:27,792 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:20:27,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:27,793 INFO L225 Difference]: With dead ends: 317 [2025-04-13 22:20:27,793 INFO L226 Difference]: Without dead ends: 302 [2025-04-13 22:20:27,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=2279, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:20:27,793 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:27,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:20:27,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-04-13 22:20:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 255. [2025-04-13 22:20:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 2.7086614173228347) internal successors, (688), 254 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call 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,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 688 transitions. [2025-04-13 22:20:28,177 INFO L79 Accepts]: Start accepts. Automaton has 255 states and 688 transitions. Word has length 30 [2025-04-13 22:20:28,177 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:28,177 INFO L485 AbstractCegarLoop]: Abstraction has 255 states and 688 transitions. [2025-04-13 22:20:28,177 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:20:28,177 INFO L278 IsEmpty]: Start isEmpty. Operand 255 states and 688 transitions. [2025-04-13 22:20:28,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:28,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:28,177 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:28,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:28,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 195 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable200 [2025-04-13 22:20:28,378 INFO L403 AbstractCegarLoop]: === Iteration 202 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:28,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:28,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1420381505, now seen corresponding path program 193 times [2025-04-13 22:20:28,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:28,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452437801] [2025-04-13 22:20:28,378 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:28,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:28,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:28,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:28,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:28,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:28,955 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:20:28,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:28,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452437801] [2025-04-13 22:20:28,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452437801] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:28,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924548322] [2025-04-13 22:20:28,955 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:28,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:28,957 INFO L229 MonitoredProcess]: Starting monitored process 196 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:28,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2025-04-13 22:20:29,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:29,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:29,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:29,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:29,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:20:29,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:29,552 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:29,552 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 35 treesize of output 23 [2025-04-13 22:20:29,582 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:20:29,582 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:29,859 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:20:29,859 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 181 treesize of output 113 [2025-04-13 22:20:29,940 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:20:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924548322] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:29,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2025-04-13 22:20:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822301890] [2025-04-13 22:20:29,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:29,941 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:20:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:29,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:20:29,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1209, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:20:29,941 INFO L87 Difference]: Start difference. First operand 255 states and 688 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:31,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:31,855 INFO L93 Difference]: Finished difference Result 349 states and 901 transitions. [2025-04-13 22:20:31,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:20:31,855 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:31,855 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:31,856 INFO L225 Difference]: With dead ends: 349 [2025-04-13 22:20:31,856 INFO L226 Difference]: Without dead ends: 340 [2025-04-13 22:20:31,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=372, Invalid=2934, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:20:31,856 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:31,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 1720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:20:31,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-04-13 22:20:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 265. [2025-04-13 22:20:32,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 264 states have (on average 2.7234848484848486) internal successors, (719), 264 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:20:32,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 719 transitions. [2025-04-13 22:20:32,255 INFO L79 Accepts]: Start accepts. Automaton has 265 states and 719 transitions. Word has length 30 [2025-04-13 22:20:32,255 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:32,255 INFO L485 AbstractCegarLoop]: Abstraction has 265 states and 719 transitions. [2025-04-13 22:20:32,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:32,255 INFO L278 IsEmpty]: Start isEmpty. Operand 265 states and 719 transitions. [2025-04-13 22:20:32,255 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:32,255 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:32,255 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:32,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Ended with exit code 0 [2025-04-13 22:20:32,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 196 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable201 [2025-04-13 22:20:32,456 INFO L403 AbstractCegarLoop]: === Iteration 203 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:32,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:32,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1097689423, now seen corresponding path program 194 times [2025-04-13 22:20:32,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:32,456 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668750776] [2025-04-13 22:20:32,456 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:32,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:32,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:32,482 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:32,482 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:32,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:33,006 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:20:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:33,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668750776] [2025-04-13 22:20:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668750776] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:33,006 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56935749] [2025-04-13 22:20:33,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:33,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:33,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:33,008 INFO L229 MonitoredProcess]: Starting monitored process 197 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:33,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Waiting until timeout for monitored process [2025-04-13 22:20:33,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:33,506 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:33,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:33,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:33,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:20:33,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:33,603 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:33,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 27 treesize of output 19 [2025-04-13 22:20:33,643 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:20:33,643 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:33,851 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:20:33,852 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 173 treesize of output 107 [2025-04-13 22:20:33,972 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:20:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56935749] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:33,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:33,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 33 [2025-04-13 22:20:33,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876616629] [2025-04-13 22:20:33,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:33,973 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:20:33,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:33,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:20:33,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1003, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:20:33,973 INFO L87 Difference]: Start difference. First operand 265 states and 719 transitions. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:20:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:35,601 INFO L93 Difference]: Finished difference Result 323 states and 828 transitions. [2025-04-13 22:20:35,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:20:35,601 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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 30 [2025-04-13 22:20:35,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:35,602 INFO L225 Difference]: With dead ends: 323 [2025-04-13 22:20:35,602 INFO L226 Difference]: Without dead ends: 314 [2025-04-13 22:20:35,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=350, Invalid=2512, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:20:35,603 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 124 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:35,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 0 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:20:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-04-13 22:20:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 257. [2025-04-13 22:20:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 2.68359375) internal successors, (687), 256 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call 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,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 687 transitions. [2025-04-13 22:20:36,009 INFO L79 Accepts]: Start accepts. Automaton has 257 states and 687 transitions. Word has length 30 [2025-04-13 22:20:36,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:36,009 INFO L485 AbstractCegarLoop]: Abstraction has 257 states and 687 transitions. [2025-04-13 22:20:36,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:20:36,010 INFO L278 IsEmpty]: Start isEmpty. Operand 257 states and 687 transitions. [2025-04-13 22:20:36,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:36,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:36,010 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,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Ended with exit code 0 [2025-04-13 22:20:36,210 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 197 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable202 [2025-04-13 22:20:36,210 INFO L403 AbstractCegarLoop]: === Iteration 204 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:36,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:36,211 INFO L85 PathProgramCache]: Analyzing trace with hash -352778815, now seen corresponding path program 195 times [2025-04-13 22:20:36,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:36,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144500713] [2025-04-13 22:20:36,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:36,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:36,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:36,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:20:36,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:20:36,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:36,638 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:20:36,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:36,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144500713] [2025-04-13 22:20:36,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144500713] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:36,638 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510549156] [2025-04-13 22:20:36,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:20:36,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:36,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:36,640 INFO L229 MonitoredProcess]: Starting monitored process 198 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:36,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2025-04-13 22:20:37,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:37,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:20:37,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:20:37,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:37,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:20:37,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:37,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:37,222 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 27 treesize of output 19 [2025-04-13 22:20:37,263 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:20:37,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:37,510 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:20:37,510 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 181 treesize of output 113 [2025-04-13 22:20:37,601 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:20:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510549156] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:37,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-13 22:20:37,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299316812] [2025-04-13 22:20:37,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:37,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:20:37,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:37,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:20:37,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:20:37,602 INFO L87 Difference]: Start difference. First operand 257 states and 687 transitions. Second operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:20:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:39,213 INFO L93 Difference]: Finished difference Result 347 states and 880 transitions. [2025-04-13 22:20:39,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:20:39,213 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:20:39,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:39,214 INFO L225 Difference]: With dead ends: 347 [2025-04-13 22:20:39,214 INFO L226 Difference]: Without dead ends: 338 [2025-04-13 22:20:39,215 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=260, Invalid=1810, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:20:39,215 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:39,215 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:20:39,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-04-13 22:20:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 255. [2025-04-13 22:20:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 254 states have (on average 2.677165354330709) internal successors, (680), 254 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call 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:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 680 transitions. [2025-04-13 22:20:39,598 INFO L79 Accepts]: Start accepts. Automaton has 255 states and 680 transitions. Word has length 30 [2025-04-13 22:20:39,598 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:39,598 INFO L485 AbstractCegarLoop]: Abstraction has 255 states and 680 transitions. [2025-04-13 22:20:39,598 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:20:39,598 INFO L278 IsEmpty]: Start isEmpty. Operand 255 states and 680 transitions. [2025-04-13 22:20:39,598 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:39,598 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:39,598 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:39,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Ended with exit code 0 [2025-04-13 22:20:39,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 198 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable203 [2025-04-13 22:20:39,799 INFO L403 AbstractCegarLoop]: === Iteration 205 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:39,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1478934167, now seen corresponding path program 196 times [2025-04-13 22:20:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:39,799 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5185955] [2025-04-13 22:20:39,799 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:39,811 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:39,824 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:39,825 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:39,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:20:40,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:40,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5185955] [2025-04-13 22:20:40,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5185955] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:40,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611369692] [2025-04-13 22:20:40,431 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:20:40,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:40,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:40,432 INFO L229 MonitoredProcess]: Starting monitored process 199 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:40,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2025-04-13 22:20:40,903 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:40,929 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:40,930 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:20:40,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:40,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:20:40,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:41,026 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:41,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 35 treesize of output 23 [2025-04-13 22:20:41,078 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:20:41,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:41,332 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:20:41,332 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 173 treesize of output 107 [2025-04-13 22:20:41,445 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:20:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611369692] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:41,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:20:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459099201] [2025-04-13 22:20:41,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:41,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:20:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:41,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:20:41,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1339, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:20:41,446 INFO L87 Difference]: Start difference. First operand 255 states and 680 transitions. Second operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:20:43,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:43,539 INFO L93 Difference]: Finished difference Result 341 states and 867 transitions. [2025-04-13 22:20:43,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:20:43,539 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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 30 [2025-04-13 22:20:43,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:43,541 INFO L225 Difference]: With dead ends: 341 [2025-04-13 22:20:43,541 INFO L226 Difference]: Without dead ends: 328 [2025-04-13 22:20:43,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=409, Invalid=3497, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:20:43,541 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:43,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:20:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-04-13 22:20:43,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 262. [2025-04-13 22:20:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 261 states have (on average 2.6973180076628354) internal successors, (704), 261 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call 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,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 704 transitions. [2025-04-13 22:20:43,944 INFO L79 Accepts]: Start accepts. Automaton has 262 states and 704 transitions. Word has length 30 [2025-04-13 22:20:43,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:43,944 INFO L485 AbstractCegarLoop]: Abstraction has 262 states and 704 transitions. [2025-04-13 22:20:43,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:20:43,944 INFO L278 IsEmpty]: Start isEmpty. Operand 262 states and 704 transitions. [2025-04-13 22:20:43,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:43,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:43,945 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:20:43,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:44,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable204,199 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:44,145 INFO L403 AbstractCegarLoop]: === Iteration 206 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:44,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash 486917796, now seen corresponding path program 197 times [2025-04-13 22:20:44,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:44,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779239494] [2025-04-13 22:20:44,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:44,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:44,158 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:44,172 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:44,172 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:44,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-13 22:20:44,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:44,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779239494] [2025-04-13 22:20:44,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779239494] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:44,574 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531140824] [2025-04-13 22:20:44,574 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:20:44,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:44,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:44,576 INFO L229 MonitoredProcess]: Starting monitored process 200 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:44,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2025-04-13 22:20:45,036 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:45,131 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:45,131 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:20:45,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:45,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:20:45,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:45,363 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:45,363 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 46 treesize of output 30 [2025-04-13 22:20:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-04-13 22:20:45,403 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:45,557 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:20:45,557 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 67 treesize of output 71 [2025-04-13 22:20:45,609 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-13 22:20:45,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531140824] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:45,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:45,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 9] total 29 [2025-04-13 22:20:45,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636600624] [2025-04-13 22:20:45,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:45,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:20:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:45,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:20:45,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:20:45,610 INFO L87 Difference]: Start difference. First operand 262 states and 704 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:20:46,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:46,946 INFO L93 Difference]: Finished difference Result 317 states and 830 transitions. [2025-04-13 22:20:46,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 22:20:46,946 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 30 [2025-04-13 22:20:46,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:46,947 INFO L225 Difference]: With dead ends: 317 [2025-04-13 22:20:46,947 INFO L226 Difference]: Without dead ends: 306 [2025-04-13 22:20:46,947 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1226, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:20:46,947 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 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:20:46,948 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 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:20:46,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-13 22:20:47,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 258. [2025-04-13 22:20:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.692607003891051) internal successors, (692), 257 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call 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:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 692 transitions. [2025-04-13 22:20:47,340 INFO L79 Accepts]: Start accepts. Automaton has 258 states and 692 transitions. Word has length 30 [2025-04-13 22:20:47,340 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:47,340 INFO L485 AbstractCegarLoop]: Abstraction has 258 states and 692 transitions. [2025-04-13 22:20:47,340 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:20:47,340 INFO L278 IsEmpty]: Start isEmpty. Operand 258 states and 692 transitions. [2025-04-13 22:20:47,341 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:47,341 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:47,341 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:47,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Ended with exit code 0 [2025-04-13 22:20:47,541 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 200 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable205 [2025-04-13 22:20:47,541 INFO L403 AbstractCegarLoop]: === Iteration 207 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:47,541 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash 912868941, now seen corresponding path program 198 times [2025-04-13 22:20:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:47,542 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383241636] [2025-04-13 22:20:47,542 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:47,554 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:47,572 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:47,572 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:47,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:48,054 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:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:48,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383241636] [2025-04-13 22:20:48,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383241636] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:48,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781772500] [2025-04-13 22:20:48,054 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:20:48,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:48,056 INFO L229 MonitoredProcess]: Starting monitored process 201 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:48,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Waiting until timeout for monitored process [2025-04-13 22:20:48,524 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:20:48,562 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:48,562 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:20:48,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:48,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 22:20:48,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:48,581 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 22:20:48,722 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:20:48,722 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 27 treesize of output 15 [2025-04-13 22:20:48,748 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:48,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:49,417 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:49,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781772500] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:49,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:49,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 33 [2025-04-13 22:20:49,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505205961] [2025-04-13 22:20:49,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:49,418 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:20:49,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:49,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:20:49,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1002, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:20:49,418 INFO L87 Difference]: Start difference. First operand 258 states and 692 transitions. Second operand has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 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:51,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:51,612 INFO L93 Difference]: Finished difference Result 343 states and 885 transitions. [2025-04-13 22:20:51,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:20:51,612 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 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:51,613 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:51,614 INFO L225 Difference]: With dead ends: 343 [2025-04-13 22:20:51,614 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 22:20:51,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=263, Invalid=2389, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 22:20:51,614 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:51,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 22:20:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 22:20:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 274. [2025-04-13 22:20:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 2.73992673992674) internal successors, (748), 273 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call 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,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 748 transitions. [2025-04-13 22:20:52,041 INFO L79 Accepts]: Start accepts. Automaton has 274 states and 748 transitions. Word has length 30 [2025-04-13 22:20:52,041 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:52,041 INFO L485 AbstractCegarLoop]: Abstraction has 274 states and 748 transitions. [2025-04-13 22:20:52,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 34 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:52,041 INFO L278 IsEmpty]: Start isEmpty. Operand 274 states and 748 transitions. [2025-04-13 22:20:52,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:52,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:52,041 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:52,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Ended with exit code 0 [2025-04-13 22:20:52,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 201 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable206 [2025-04-13 22:20:52,242 INFO L403 AbstractCegarLoop]: === Iteration 208 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:52,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:52,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1431679779, now seen corresponding path program 199 times [2025-04-13 22:20:52,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:52,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024593707] [2025-04-13 22:20:52,242 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:52,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:52,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:52,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:52,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:52,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:52,840 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:52,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:52,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024593707] [2025-04-13 22:20:52,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024593707] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:52,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727645731] [2025-04-13 22:20:52,841 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:20:52,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:52,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:52,843 INFO L229 MonitoredProcess]: Starting monitored process 202 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:52,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Waiting until timeout for monitored process [2025-04-13 22:20:53,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:20:53,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:20:53,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:20:53,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:53,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:20:53,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:53,435 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:53,435 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 35 treesize of output 23 [2025-04-13 22:20:53,463 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:53,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:53,693 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:20:53,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 173 treesize of output 107 [2025-04-13 22:20:53,777 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:53,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727645731] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:53,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:53,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2025-04-13 22:20:53,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991346216] [2025-04-13 22:20:53,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:53,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:20:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:53,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:20:53,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:20:53,778 INFO L87 Difference]: Start difference. First operand 274 states and 748 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:56,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:20:56,053 INFO L93 Difference]: Finished difference Result 397 states and 1025 transitions. [2025-04-13 22:20:56,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:20:56,053 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:56,053 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:20:56,054 INFO L225 Difference]: With dead ends: 397 [2025-04-13 22:20:56,054 INFO L226 Difference]: Without dead ends: 384 [2025-04-13 22:20:56,055 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=439, Invalid=3593, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:20:56,055 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:20:56,055 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 1866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:20:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-04-13 22:20:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 288. [2025-04-13 22:20:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 287 states have (on average 2.7630662020905925) internal successors, (793), 287 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call 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:56,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 793 transitions. [2025-04-13 22:20:56,532 INFO L79 Accepts]: Start accepts. Automaton has 288 states and 793 transitions. Word has length 30 [2025-04-13 22:20:56,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:20:56,533 INFO L485 AbstractCegarLoop]: Abstraction has 288 states and 793 transitions. [2025-04-13 22:20:56,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:20:56,533 INFO L278 IsEmpty]: Start isEmpty. Operand 288 states and 793 transitions. [2025-04-13 22:20:56,533 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:20:56,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:20:56,533 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:56,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Forceful destruction successful, exit code 0 [2025-04-13 22:20:56,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable207,202 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:56,733 INFO L403 AbstractCegarLoop]: === Iteration 209 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:20:56,734 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:20:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 857457681, now seen corresponding path program 200 times [2025-04-13 22:20:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:20:56,734 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738207209] [2025-04-13 22:20:56,734 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:20:56,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:56,759 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:56,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:56,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:57,284 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:20:57,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:20:57,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738207209] [2025-04-13 22:20:57,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738207209] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:20:57,285 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466145165] [2025-04-13 22:20:57,285 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:20:57,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:20:57,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:20:57,287 INFO L229 MonitoredProcess]: Starting monitored process 203 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:57,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Waiting until timeout for monitored process [2025-04-13 22:20:57,762 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:20:57,789 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:57,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:20:57,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:20:57,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:20:57,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:20:57,907 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:20:57,907 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 27 treesize of output 19 [2025-04-13 22:20:57,947 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:20:57,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:20:58,178 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:20:58,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 173 treesize of output 107 [2025-04-13 22:20:58,295 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:58,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466145165] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:20:58,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:20:58,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 34 [2025-04-13 22:20:58,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014343578] [2025-04-13 22:20:58,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:20:58,295 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:20:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:20:58,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:20:58,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1062, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:20:58,296 INFO L87 Difference]: Start difference. First operand 288 states and 793 transitions. Second operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:00,117 INFO L93 Difference]: Finished difference Result 377 states and 988 transitions. [2025-04-13 22:21:00,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:21:00,117 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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,117 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:00,119 INFO L225 Difference]: With dead ends: 377 [2025-04-13 22:21:00,119 INFO L226 Difference]: Without dead ends: 368 [2025-04-13 22:21:00,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=342, Invalid=2414, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:21:00,119 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:00,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-04-13 22:21:00,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 290. [2025-04-13 22:21:00,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 2.7750865051903113) internal successors, (802), 289 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call 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,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 802 transitions. [2025-04-13 22:21:00,583 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 802 transitions. Word has length 30 [2025-04-13 22:21:00,583 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:00,583 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 802 transitions. [2025-04-13 22:21:00,583 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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,583 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 802 transitions. [2025-04-13 22:21:00,583 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:00,583 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:00,584 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:00,592 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (203)] Ended with exit code 0 [2025-04-13 22:21:00,784 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable208,203 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:00,784 INFO L403 AbstractCegarLoop]: === Iteration 210 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:00,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1200355071, now seen corresponding path program 201 times [2025-04-13 22:21:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:00,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385957086] [2025-04-13 22:21:00,784 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:00,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:00,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:00,813 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:00,813 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:00,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:01,210 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:01,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:01,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385957086] [2025-04-13 22:21:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385957086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:01,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990257858] [2025-04-13 22:21:01,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:01,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:01,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:01,212 INFO L229 MonitoredProcess]: Starting monitored process 204 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:01,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Waiting until timeout for monitored process [2025-04-13 22:21:01,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:01,723 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:01,723 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:01,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:01,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-13 22:21:01,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:01,884 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:01,884 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 27 treesize of output 19 [2025-04-13 22:21:01,933 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:01,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:02,101 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:02,101 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 136 treesize of output 117 [2025-04-13 22:21:02,360 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:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990257858] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:02,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 22:21:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343669864] [2025-04-13 22:21:02,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:02,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:21:02,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:02,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:21:02,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:21:02,361 INFO L87 Difference]: Start difference. First operand 290 states and 802 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:21:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:04,701 INFO L93 Difference]: Finished difference Result 420 states and 1074 transitions. [2025-04-13 22:21:04,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:21:04,701 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:21:04,701 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:04,702 INFO L225 Difference]: With dead ends: 420 [2025-04-13 22:21:04,702 INFO L226 Difference]: Without dead ends: 401 [2025-04-13 22:21:04,702 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=2990, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:21:04,703 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1880 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:04,703 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1880 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:21:04,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-04-13 22:21:05,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 294. [2025-04-13 22:21:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.7849829351535837) internal successors, (816), 293 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call 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:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 816 transitions. [2025-04-13 22:21:05,198 INFO L79 Accepts]: Start accepts. Automaton has 294 states and 816 transitions. Word has length 30 [2025-04-13 22:21:05,198 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:05,198 INFO L485 AbstractCegarLoop]: Abstraction has 294 states and 816 transitions. [2025-04-13 22:21:05,198 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:21:05,198 INFO L278 IsEmpty]: Start isEmpty. Operand 294 states and 816 transitions. [2025-04-13 22:21:05,199 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:05,199 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:05,199 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:05,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (204)] Forceful destruction successful, exit code 0 [2025-04-13 22:21:05,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 204 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable209 [2025-04-13 22:21:05,399 INFO L403 AbstractCegarLoop]: === Iteration 211 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:05,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:05,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1719165909, now seen corresponding path program 202 times [2025-04-13 22:21:05,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:05,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047100822] [2025-04-13 22:21:05,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:05,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:05,413 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:05,425 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:05,426 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:05,993 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:21:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:05,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047100822] [2025-04-13 22:21:05,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047100822] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:05,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776284879] [2025-04-13 22:21:05,994 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:05,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:05,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:05,995 INFO L229 MonitoredProcess]: Starting monitored process 205 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:05,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (205)] Waiting until timeout for monitored process [2025-04-13 22:21:06,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:06,492 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:06,492 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:06,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:06,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:21:06,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:06,579 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:06,579 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 35 treesize of output 23 [2025-04-13 22:21:06,625 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:06,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:06,841 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:21:06,841 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 173 treesize of output 107 [2025-04-13 22:21:06,961 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:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776284879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:06,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:06,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:21:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634427812] [2025-04-13 22:21:06,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:06,961 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:21:06,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:06,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:21:06,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1334, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:21:06,962 INFO L87 Difference]: Start difference. First operand 294 states and 816 transitions. Second operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:21:08,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:08,819 INFO L93 Difference]: Finished difference Result 361 states and 961 transitions. [2025-04-13 22:21:08,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:21:08,819 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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 30 [2025-04-13 22:21:08,819 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:08,820 INFO L225 Difference]: With dead ends: 361 [2025-04-13 22:21:08,820 INFO L226 Difference]: Without dead ends: 352 [2025-04-13 22:21:08,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=428, Invalid=3232, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:21:08,820 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:08,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:08,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-04-13 22:21:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 292. [2025-04-13 22:21:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 2.7731958762886597) internal successors, (807), 291 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call 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:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 807 transitions. [2025-04-13 22:21:09,284 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 807 transitions. Word has length 30 [2025-04-13 22:21:09,284 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:09,284 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 807 transitions. [2025-04-13 22:21:09,284 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:21:09,284 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 807 transitions. [2025-04-13 22:21:09,284 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:09,284 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:09,284 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:09,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (205)] Ended with exit code 0 [2025-04-13 22:21:09,484 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 205 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable210 [2025-04-13 22:21:09,485 INFO L403 AbstractCegarLoop]: === Iteration 212 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:09,485 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1656649591, now seen corresponding path program 203 times [2025-04-13 22:21:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:09,485 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4047711] [2025-04-13 22:21:09,485 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:09,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:09,498 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:09,520 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:09,521 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:21:09,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 22:21:10,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:10,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4047711] [2025-04-13 22:21:10,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4047711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:10,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963001905] [2025-04-13 22:21:10,161 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:10,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:10,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:10,163 INFO L229 MonitoredProcess]: Starting monitored process 206 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:10,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (206)] Waiting until timeout for monitored process [2025-04-13 22:21:10,638 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:10,803 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:10,803 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:21:10,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:10,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:21:10,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:10,993 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:10,993 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 31 treesize of output 23 [2025-04-13 22:21:10,997 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:21:10,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:11,340 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:11,340 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 181 treesize of output 113 [2025-04-13 22:21:11,421 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:21:11,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963001905] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:11,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:11,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 11] total 37 [2025-04-13 22:21:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082285513] [2025-04-13 22:21:11,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:11,422 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:21:11,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:11,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:21:11,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1281, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:21:11,422 INFO L87 Difference]: Start difference. First operand 292 states and 807 transitions. Second operand has 38 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 38 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:21:13,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:13,337 INFO L93 Difference]: Finished difference Result 380 states and 1016 transitions. [2025-04-13 22:21:13,337 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:21:13,338 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 38 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 30 [2025-04-13 22:21:13,338 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:13,339 INFO L225 Difference]: With dead ends: 380 [2025-04-13 22:21:13,339 INFO L226 Difference]: Without dead ends: 371 [2025-04-13 22:21:13,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=272, Invalid=2590, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:21:13,339 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:13,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:13,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-04-13 22:21:13,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 300. [2025-04-13 22:21:13,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 2.7859531772575252) internal successors, (833), 299 states have internal predecessors, (833), 0 states have call successors, (0), 0 states have call 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:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 833 transitions. [2025-04-13 22:21:13,831 INFO L79 Accepts]: Start accepts. Automaton has 300 states and 833 transitions. Word has length 30 [2025-04-13 22:21:13,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:13,831 INFO L485 AbstractCegarLoop]: Abstraction has 300 states and 833 transitions. [2025-04-13 22:21:13,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.6486486486486487) internal successors, (61), 38 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:21:13,831 INFO L278 IsEmpty]: Start isEmpty. Operand 300 states and 833 transitions. [2025-04-13 22:21:13,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:13,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:13,832 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:13,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (206)] Ended with exit code 0 [2025-04-13 22:21:14,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable211,206 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:14,032 INFO L403 AbstractCegarLoop]: === Iteration 213 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:14,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash 9881425, now seen corresponding path program 204 times [2025-04-13 22:21:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:14,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92258988] [2025-04-13 22:21:14,033 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:14,045 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:14,056 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:14,057 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:14,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:14,476 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:14,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:14,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92258988] [2025-04-13 22:21:14,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92258988] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:14,477 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473855721] [2025-04-13 22:21:14,477 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:14,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:14,478 INFO L229 MonitoredProcess]: Starting monitored process 207 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:14,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Waiting until timeout for monitored process [2025-04-13 22:21:14,945 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:14,978 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:14,978 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:14,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:14,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:21:14,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:15,129 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:15,129 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 27 treesize of output 19 [2025-04-13 22:21:15,166 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:21:15,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:15,416 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:15,417 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 181 treesize of output 113 [2025-04-13 22:21:15,526 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:15,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473855721] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:15,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:15,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 11] total 33 [2025-04-13 22:21:15,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839125128] [2025-04-13 22:21:15,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:15,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:21:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:15,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:21:15,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=994, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:21:15,527 INFO L87 Difference]: Start difference. First operand 300 states and 833 transitions. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:21:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:17,601 INFO L93 Difference]: Finished difference Result 402 states and 1065 transitions. [2025-04-13 22:21:17,601 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:21:17,601 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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 30 [2025-04-13 22:21:17,601 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:17,603 INFO L225 Difference]: With dead ends: 402 [2025-04-13 22:21:17,603 INFO L226 Difference]: Without dead ends: 389 [2025-04-13 22:21:17,603 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=319, Invalid=2437, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:21:17,603 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:17,603 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2025-04-13 22:21:18,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 307. [2025-04-13 22:21:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 306 states have (on average 2.784313725490196) internal successors, (852), 306 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call 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,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 852 transitions. [2025-04-13 22:21:18,154 INFO L79 Accepts]: Start accepts. Automaton has 307 states and 852 transitions. Word has length 30 [2025-04-13 22:21:18,155 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:18,155 INFO L485 AbstractCegarLoop]: Abstraction has 307 states and 852 transitions. [2025-04-13 22:21:18,155 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:21:18,155 INFO L278 IsEmpty]: Start isEmpty. Operand 307 states and 852 transitions. [2025-04-13 22:21:18,155 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:18,155 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:18,155 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,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (207)] Ended with exit code 0 [2025-04-13 22:21:18,355 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 207 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable212 [2025-04-13 22:21:18,356 INFO L403 AbstractCegarLoop]: === Iteration 214 === 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,356 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:18,356 INFO L85 PathProgramCache]: Analyzing trace with hash -53963717, now seen corresponding path program 205 times [2025-04-13 22:21:18,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:18,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892812781] [2025-04-13 22:21:18,356 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:18,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:18,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:21:18,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:18,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:18,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:18,930 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:21:18,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:18,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892812781] [2025-04-13 22:21:18,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892812781] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:18,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374432890] [2025-04-13 22:21:18,931 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:18,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:18,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:18,932 INFO L229 MonitoredProcess]: Starting monitored process 208 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,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (208)] Waiting until timeout for monitored process [2025-04-13 22:21:19,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:21:19,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:19,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:19,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:19,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:21:19,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:19,544 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:19,545 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 35 treesize of output 23 [2025-04-13 22:21:19,577 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:21:19,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:19,899 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:19,899 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 181 treesize of output 113 [2025-04-13 22:21:19,977 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:21:19,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374432890] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:19,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:19,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 22:21:19,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488952231] [2025-04-13 22:21:19,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:19,977 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:21:19,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:19,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:21:19,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:21:19,978 INFO L87 Difference]: Start difference. First operand 307 states and 852 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:21:22,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:22,298 INFO L93 Difference]: Finished difference Result 402 states and 1064 transitions. [2025-04-13 22:21:22,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:21:22,299 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:21:22,299 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:22,300 INFO L225 Difference]: With dead ends: 402 [2025-04-13 22:21:22,300 INFO L226 Difference]: Without dead ends: 393 [2025-04-13 22:21:22,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=355, Invalid=2951, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:21:22,300 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 138 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:22,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 0 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-04-13 22:21:22,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 311. [2025-04-13 22:21:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 2.793548387096774) internal successors, (866), 310 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call 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:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 866 transitions. [2025-04-13 22:21:22,834 INFO L79 Accepts]: Start accepts. Automaton has 311 states and 866 transitions. Word has length 30 [2025-04-13 22:21:22,834 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:22,834 INFO L485 AbstractCegarLoop]: Abstraction has 311 states and 866 transitions. [2025-04-13 22:21:22,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:21:22,834 INFO L278 IsEmpty]: Start isEmpty. Operand 311 states and 866 transitions. [2025-04-13 22:21:22,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:22,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:22,834 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:22,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (208)] Ended with exit code 0 [2025-04-13 22:21:23,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 208 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable213 [2025-04-13 22:21:23,035 INFO L403 AbstractCegarLoop]: === Iteration 215 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:23,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:23,035 INFO L85 PathProgramCache]: Analyzing trace with hash 521317033, now seen corresponding path program 206 times [2025-04-13 22:21:23,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:23,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085641122] [2025-04-13 22:21:23,035 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:23,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:23,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:23,060 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:23,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:23,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:23,624 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:21:23,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:23,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085641122] [2025-04-13 22:21:23,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085641122] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:23,624 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517870004] [2025-04-13 22:21:23,624 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:23,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:23,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:23,626 INFO L229 MonitoredProcess]: Starting monitored process 209 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:23,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (209)] Waiting until timeout for monitored process [2025-04-13 22:21:24,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:24,154 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:24,154 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:24,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:24,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:21:24,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:24,299 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:24,300 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 27 treesize of output 19 [2025-04-13 22:21:24,327 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:21:24,327 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:24,595 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:24,595 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 181 treesize of output 113 [2025-04-13 22:21:24,704 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:24,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517870004] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:24,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:24,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 34 [2025-04-13 22:21:24,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031643201] [2025-04-13 22:21:24,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:24,704 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:21:24,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:24,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:21:24,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:21:24,705 INFO L87 Difference]: Start difference. First operand 311 states and 866 transitions. Second operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:26,841 INFO L93 Difference]: Finished difference Result 399 states and 1076 transitions. [2025-04-13 22:21:26,841 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:21:26,841 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:26,841 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:26,843 INFO L225 Difference]: With dead ends: 399 [2025-04-13 22:21:26,843 INFO L226 Difference]: Without dead ends: 390 [2025-04-13 22:21:26,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=2974, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:21:26,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:26,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-04-13 22:21:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 323. [2025-04-13 22:21:27,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 2.7950310559006213) internal successors, (900), 322 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call 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:27,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 900 transitions. [2025-04-13 22:21:27,420 INFO L79 Accepts]: Start accepts. Automaton has 323 states and 900 transitions. Word has length 30 [2025-04-13 22:21:27,420 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:27,420 INFO L485 AbstractCegarLoop]: Abstraction has 323 states and 900 transitions. [2025-04-13 22:21:27,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:27,420 INFO L278 IsEmpty]: Start isEmpty. Operand 323 states and 900 transitions. [2025-04-13 22:21:27,420 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:27,420 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:27,420 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:27,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (209)] Ended with exit code 0 [2025-04-13 22:21:27,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 209 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable214 [2025-04-13 22:21:27,621 INFO L403 AbstractCegarLoop]: === Iteration 216 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:27,621 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:27,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1771712777, now seen corresponding path program 207 times [2025-04-13 22:21:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:27,621 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689991450] [2025-04-13 22:21:27,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:27,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:27,650 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:27,650 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:27,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:28,023 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:21:28,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:28,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689991450] [2025-04-13 22:21:28,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689991450] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:28,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100965670] [2025-04-13 22:21:28,024 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:28,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:28,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:28,025 INFO L229 MonitoredProcess]: Starting monitored process 210 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:28,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (210)] Waiting until timeout for monitored process [2025-04-13 22:21:28,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:28,562 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:28,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:28,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:28,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:21:28,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:28,671 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:28,671 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 27 treesize of output 19 [2025-04-13 22:21:28,691 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:21:28,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:28,975 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:28,975 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 181 treesize of output 113 [2025-04-13 22:21:29,060 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:21:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100965670] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:29,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:29,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 22:21:29,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928244482] [2025-04-13 22:21:29,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:29,060 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:21:29,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:29,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:21:29,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:21:29,060 INFO L87 Difference]: Start difference. First operand 323 states and 900 transitions. Second operand has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 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:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:31,068 INFO L93 Difference]: Finished difference Result 414 states and 1106 transitions. [2025-04-13 22:21:31,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:21:31,068 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 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:31,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:31,069 INFO L225 Difference]: With dead ends: 414 [2025-04-13 22:21:31,069 INFO L226 Difference]: Without dead ends: 405 [2025-04-13 22:21:31,070 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=212, Invalid=1594, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:21:31,070 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:31,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:31,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-04-13 22:21:31,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 327. [2025-04-13 22:21:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.803680981595092) internal successors, (914), 326 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call 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:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 914 transitions. [2025-04-13 22:21:31,644 INFO L79 Accepts]: Start accepts. Automaton has 327 states and 914 transitions. Word has length 30 [2025-04-13 22:21:31,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:31,644 INFO L485 AbstractCegarLoop]: Abstraction has 327 states and 914 transitions. [2025-04-13 22:21:31,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 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:31,644 INFO L278 IsEmpty]: Start isEmpty. Operand 327 states and 914 transitions. [2025-04-13 22:21:31,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:31,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:31,645 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:31,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (210)] Ended with exit code 0 [2025-04-13 22:21:31,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable215,210 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:31,845 INFO L403 AbstractCegarLoop]: === Iteration 217 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:31,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1196432027, now seen corresponding path program 208 times [2025-04-13 22:21:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:31,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135048896] [2025-04-13 22:21:31,845 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:31,858 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:31,870 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:31,870 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:31,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:32,501 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:21:32,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:32,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135048896] [2025-04-13 22:21:32,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135048896] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:32,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401004156] [2025-04-13 22:21:32,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:32,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:32,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:32,503 INFO L229 MonitoredProcess]: Starting monitored process 211 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:32,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (211)] Waiting until timeout for monitored process [2025-04-13 22:21:33,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:33,030 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:33,030 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:33,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:33,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:21:33,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:33,150 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:33,150 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 35 treesize of output 23 [2025-04-13 22:21:33,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:21:33,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:33,442 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:33,443 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 181 treesize of output 113 [2025-04-13 22:21:33,545 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:33,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401004156] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:33,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:33,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 22:21:33,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529673072] [2025-04-13 22:21:33,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:33,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:21:33,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:33,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:21:33,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:21:33,546 INFO L87 Difference]: Start difference. First operand 327 states and 914 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:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:35,957 INFO L93 Difference]: Finished difference Result 412 states and 1107 transitions. [2025-04-13 22:21:35,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:21:35,957 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:35,957 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:35,958 INFO L225 Difference]: With dead ends: 412 [2025-04-13 22:21:35,958 INFO L226 Difference]: Without dead ends: 403 [2025-04-13 22:21:35,958 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=415, Invalid=3617, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:21:35,959 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 139 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:35,959 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 0 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-04-13 22:21:36,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 323. [2025-04-13 22:21:36,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 2.7950310559006213) internal successors, (900), 322 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call 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:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 900 transitions. [2025-04-13 22:21:36,545 INFO L79 Accepts]: Start accepts. Automaton has 323 states and 900 transitions. Word has length 30 [2025-04-13 22:21:36,545 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:36,545 INFO L485 AbstractCegarLoop]: Abstraction has 323 states and 900 transitions. [2025-04-13 22:21:36,545 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:36,545 INFO L278 IsEmpty]: Start isEmpty. Operand 323 states and 900 transitions. [2025-04-13 22:21:36,546 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:36,546 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:36,546 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:36,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (211)] Ended with exit code 0 [2025-04-13 22:21:36,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 211 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable216 [2025-04-13 22:21:36,746 INFO L403 AbstractCegarLoop]: === Iteration 218 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:36,746 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1827124037, now seen corresponding path program 209 times [2025-04-13 22:21:36,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:36,746 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242126311] [2025-04-13 22:21:36,747 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:36,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:36,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:36,796 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:36,796 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:21:36,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:37,250 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:37,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:37,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242126311] [2025-04-13 22:21:37,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242126311] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:37,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [660065262] [2025-04-13 22:21:37,250 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:21:37,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:37,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:37,252 INFO L229 MonitoredProcess]: Starting monitored process 212 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:37,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (212)] Waiting until timeout for monitored process [2025-04-13 22:21:37,737 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:37,943 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:37,943 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:21:37,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:37,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:21:37,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:38,114 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:38,115 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 31 treesize of output 23 [2025-04-13 22:21:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:21:38,161 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:38,456 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:38,456 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 181 treesize of output 113 [2025-04-13 22:21:38,523 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:38,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [660065262] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:38,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:38,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 33 [2025-04-13 22:21:38,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634872953] [2025-04-13 22:21:38,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:38,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:21:38,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:38,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:21:38,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:21:38,524 INFO L87 Difference]: Start difference. First operand 323 states and 900 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:40,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:40,616 INFO L93 Difference]: Finished difference Result 410 states and 1098 transitions. [2025-04-13 22:21:40,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:21:40,616 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:40,616 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:40,617 INFO L225 Difference]: With dead ends: 410 [2025-04-13 22:21:40,617 INFO L226 Difference]: Without dead ends: 401 [2025-04-13 22:21:40,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=2184, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:21:40,618 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:40,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:21:40,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-04-13 22:21:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 319. [2025-04-13 22:21:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 2.7861635220125787) internal successors, (886), 318 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call 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,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 886 transitions. [2025-04-13 22:21:41,181 INFO L79 Accepts]: Start accepts. Automaton has 319 states and 886 transitions. Word has length 30 [2025-04-13 22:21:41,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:41,181 INFO L485 AbstractCegarLoop]: Abstraction has 319 states and 886 transitions. [2025-04-13 22:21:41,181 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:41,181 INFO L278 IsEmpty]: Start isEmpty. Operand 319 states and 886 transitions. [2025-04-13 22:21:41,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:41,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:41,181 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,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (212)] Forceful destruction successful, exit code 0 [2025-04-13 22:21:41,381 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable217,212 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:41,382 INFO L403 AbstractCegarLoop]: === Iteration 219 === 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,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1251843287, now seen corresponding path program 210 times [2025-04-13 22:21:41,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:41,382 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205177474] [2025-04-13 22:21:41,382 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:41,394 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:41,408 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:41,408 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:41,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:41,860 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:41,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:41,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205177474] [2025-04-13 22:21:41,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205177474] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:41,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953961679] [2025-04-13 22:21:41,860 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:21:41,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:41,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:41,862 INFO L229 MonitoredProcess]: Starting monitored process 213 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:41,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (213)] Waiting until timeout for monitored process [2025-04-13 22:21:42,350 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:42,381 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:42,381 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:21:42,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:42,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 22:21:42,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:42,543 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:42,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 27 treesize of output 19 [2025-04-13 22:21:42,595 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:21:42,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:42,782 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:42,782 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 152 treesize of output 134 [2025-04-13 22:21:42,985 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,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953961679] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:42,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 11] total 32 [2025-04-13 22:21:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478627343] [2025-04-13 22:21:42,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:42,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:21:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:42,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:21:42,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:21:42,986 INFO L87 Difference]: Start difference. First operand 319 states and 886 transitions. Second operand has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:45,161 INFO L93 Difference]: Finished difference Result 420 states and 1116 transitions. [2025-04-13 22:21:45,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:21:45,161 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:45,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:45,163 INFO L225 Difference]: With dead ends: 420 [2025-04-13 22:21:45,163 INFO L226 Difference]: Without dead ends: 397 [2025-04-13 22:21:45,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=2679, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:21:45,163 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:45,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-04-13 22:21:45,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 317. [2025-04-13 22:21:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 316 states have (on average 2.7816455696202533) internal successors, (879), 316 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call 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:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 879 transitions. [2025-04-13 22:21:45,721 INFO L79 Accepts]: Start accepts. Automaton has 317 states and 879 transitions. Word has length 30 [2025-04-13 22:21:45,721 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:45,721 INFO L485 AbstractCegarLoop]: Abstraction has 317 states and 879 transitions. [2025-04-13 22:21:45,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:45,721 INFO L278 IsEmpty]: Start isEmpty. Operand 317 states and 879 transitions. [2025-04-13 22:21:45,722 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:45,722 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:45,722 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:45,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (213)] Ended with exit code 0 [2025-04-13 22:21:45,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable218,213 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:45,922 INFO L403 AbstractCegarLoop]: === Iteration 220 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:45,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:45,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1469040507, now seen corresponding path program 211 times [2025-04-13 22:21:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:45,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898983281] [2025-04-13 22:21:45,923 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:45,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:21:45,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:45,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:45,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:46,487 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:21:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:46,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898983281] [2025-04-13 22:21:46,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898983281] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:46,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721252925] [2025-04-13 22:21:46,488 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:21:46,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:46,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:46,490 INFO L229 MonitoredProcess]: Starting monitored process 214 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:46,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (214)] Waiting until timeout for monitored process [2025-04-13 22:21:46,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:21:47,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:47,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:21:47,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:47,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:21:47,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:47,111 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:47,111 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 35 treesize of output 23 [2025-04-13 22:21:47,140 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:21:47,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:47,418 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:47,418 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 181 treesize of output 113 [2025-04-13 22:21:47,507 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:21:47,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721252925] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:47,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:47,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 22:21:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953202091] [2025-04-13 22:21:47,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:47,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:21:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:47,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:21:47,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:21:47,508 INFO L87 Difference]: Start difference. First operand 317 states and 879 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:21:49,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:49,675 INFO L93 Difference]: Finished difference Result 380 states and 1027 transitions. [2025-04-13 22:21:49,676 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:21:49,676 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:21:49,676 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:49,677 INFO L225 Difference]: With dead ends: 380 [2025-04-13 22:21:49,677 INFO L226 Difference]: Without dead ends: 371 [2025-04-13 22:21:49,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=410, Invalid=3496, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:21:49,677 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:49,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 1262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-04-13 22:21:50,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 321. [2025-04-13 22:21:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 2.790625) internal successors, (893), 320 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call 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,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 893 transitions. [2025-04-13 22:21:50,253 INFO L79 Accepts]: Start accepts. Automaton has 321 states and 893 transitions. Word has length 30 [2025-04-13 22:21:50,253 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:50,253 INFO L485 AbstractCegarLoop]: Abstraction has 321 states and 893 transitions. [2025-04-13 22:21:50,253 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:21:50,253 INFO L278 IsEmpty]: Start isEmpty. Operand 321 states and 893 transitions. [2025-04-13 22:21:50,253 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:50,253 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:50,253 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,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (214)] Ended with exit code 0 [2025-04-13 22:21:50,454 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 214 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable219 [2025-04-13 22:21:50,454 INFO L403 AbstractCegarLoop]: === Iteration 221 === 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,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:50,454 INFO L85 PathProgramCache]: Analyzing trace with hash -2099419543, now seen corresponding path program 212 times [2025-04-13 22:21:50,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:50,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221505602] [2025-04-13 22:21:50,454 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:50,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:50,479 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,479 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:50,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:51,023 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:51,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:51,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221505602] [2025-04-13 22:21:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221505602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:51,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485279515] [2025-04-13 22:21:51,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:21:51,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:51,025 INFO L229 MonitoredProcess]: Starting monitored process 215 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:51,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (215)] Waiting until timeout for monitored process [2025-04-13 22:21:51,516 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:51,542 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,543 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:21:51,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:51,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:21:51,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:51,653 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:51,654 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 27 treesize of output 19 [2025-04-13 22:21:51,696 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:21:51,696 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:51,907 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:21:51,908 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 173 treesize of output 107 [2025-04-13 22:21:52,024 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:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485279515] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:52,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 34 [2025-04-13 22:21:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463618791] [2025-04-13 22:21:52,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:52,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:21:52,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:52,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:21:52,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:21:52,025 INFO L87 Difference]: Start difference. First operand 321 states and 893 transitions. Second operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:54,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:54,456 INFO L93 Difference]: Finished difference Result 430 states and 1137 transitions. [2025-04-13 22:21:54,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:21:54,457 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:54,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:54,458 INFO L225 Difference]: With dead ends: 430 [2025-04-13 22:21:54,458 INFO L226 Difference]: Without dead ends: 417 [2025-04-13 22:21:54,458 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=359, Invalid=2833, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:21:54,458 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:54,459 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:21:54,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-04-13 22:21:55,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 325. [2025-04-13 22:21:55,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 2.799382716049383) internal successors, (907), 324 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call 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:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 907 transitions. [2025-04-13 22:21:55,042 INFO L79 Accepts]: Start accepts. Automaton has 325 states and 907 transitions. Word has length 30 [2025-04-13 22:21:55,042 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:55,042 INFO L485 AbstractCegarLoop]: Abstraction has 325 states and 907 transitions. [2025-04-13 22:21:55,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:55,042 INFO L278 IsEmpty]: Start isEmpty. Operand 325 states and 907 transitions. [2025-04-13 22:21:55,042 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:55,042 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:55,042 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:55,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (215)] Ended with exit code 0 [2025-04-13 22:21:55,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable220,215 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:55,243 INFO L403 AbstractCegarLoop]: === Iteration 222 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:21:55,243 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:55,243 INFO L85 PathProgramCache]: Analyzing trace with hash -248708553, now seen corresponding path program 213 times [2025-04-13 22:21:55,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:55,243 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952451134] [2025-04-13 22:21:55,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:55,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:55,256 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:55,270 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:55,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:55,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:55,661 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:21:55,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:55,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952451134] [2025-04-13 22:21:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952451134] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:55,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764784433] [2025-04-13 22:21:55,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:21:55,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:55,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:55,663 INFO L229 MonitoredProcess]: Starting monitored process 216 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:55,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (216)] Waiting until timeout for monitored process [2025-04-13 22:21:56,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:21:56,178 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:56,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:21:56,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:56,180 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:21:56,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:21:56,306 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:21:56,306 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 27 treesize of output 19 [2025-04-13 22:21:56,328 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:21:56,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:21:56,588 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:21:56,588 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 181 treesize of output 113 [2025-04-13 22:21:56,680 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:21:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764784433] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:21:56,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:21:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 22:21:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643934919] [2025-04-13 22:21:56,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:21:56,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:21:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:21:56,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:21:56,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:21:56,681 INFO L87 Difference]: Start difference. First operand 325 states and 907 transitions. Second operand has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:21:58,598 INFO L93 Difference]: Finished difference Result 392 states and 1053 transitions. [2025-04-13 22:21:58,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 22:21:58,598 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:58,599 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:21:58,600 INFO L225 Difference]: With dead ends: 392 [2025-04-13 22:21:58,600 INFO L226 Difference]: Without dead ends: 383 [2025-04-13 22:21:58,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=294, Invalid=2156, Unknown=0, NotChecked=0, Total=2450 [2025-04-13 22:21:58,600 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:21:58,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:21:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-13 22:21:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 327. [2025-04-13 22:21:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 326 states have (on average 2.803680981595092) internal successors, (914), 326 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call 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,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 914 transitions. [2025-04-13 22:21:59,187 INFO L79 Accepts]: Start accepts. Automaton has 327 states and 914 transitions. Word has length 30 [2025-04-13 22:21:59,187 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:21:59,187 INFO L485 AbstractCegarLoop]: Abstraction has 327 states and 914 transitions. [2025-04-13 22:21:59,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,187 INFO L278 IsEmpty]: Start isEmpty. Operand 327 states and 914 transitions. [2025-04-13 22:21:59,188 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:21:59,188 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:21:59,188 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,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (216)] Ended with exit code 0 [2025-04-13 22:21:59,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable221,216 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:59,388 INFO L403 AbstractCegarLoop]: === Iteration 223 === 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,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:21:59,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2055619531, now seen corresponding path program 214 times [2025-04-13 22:21:59,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:21:59,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685512204] [2025-04-13 22:21:59,389 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:59,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:21:59,401 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:21:59,413 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:21:59,413 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:21:59,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:21:59,992 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:21:59,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:21:59,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685512204] [2025-04-13 22:21:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685512204] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:21:59,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836010631] [2025-04-13 22:21:59,993 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:21:59,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:21:59,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:21:59,994 INFO L229 MonitoredProcess]: Starting monitored process 217 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,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (217)] Waiting until timeout for monitored process [2025-04-13 22:22:00,499 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:00,524 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:00,524 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:22:00,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:00,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:22:00,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:00,632 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:00,632 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 35 treesize of output 23 [2025-04-13 22:22:00,662 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:00,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:00,893 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:22:00,893 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 173 treesize of output 107 [2025-04-13 22:22:01,009 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:01,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836010631] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:01,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:01,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:22:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132080046] [2025-04-13 22:22:01,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:01,010 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:22:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:01,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:22:01,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:22:01,010 INFO L87 Difference]: Start difference. First operand 327 states and 914 transitions. Second operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:22:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:03,344 INFO L93 Difference]: Finished difference Result 422 states and 1136 transitions. [2025-04-13 22:22:03,344 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:22:03,344 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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 30 [2025-04-13 22:22:03,344 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:03,346 INFO L225 Difference]: With dead ends: 422 [2025-04-13 22:22:03,346 INFO L226 Difference]: Without dead ends: 413 [2025-04-13 22:22:03,346 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=382, Invalid=3400, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:22:03,346 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:03,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:22:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-04-13 22:22:03,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 349. [2025-04-13 22:22:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 2.8189655172413794) internal successors, (981), 348 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call 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:03,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 981 transitions. [2025-04-13 22:22:03,972 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 981 transitions. Word has length 30 [2025-04-13 22:22:03,972 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:03,972 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 981 transitions. [2025-04-13 22:22:03,972 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:22:03,972 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 981 transitions. [2025-04-13 22:22:03,973 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:03,973 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:03,973 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:03,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (217)] Ended with exit code 0 [2025-04-13 22:22:04,173 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 217 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable222 [2025-04-13 22:22:04,173 INFO L403 AbstractCegarLoop]: === Iteration 224 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:04,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:04,174 INFO L85 PathProgramCache]: Analyzing trace with hash -304119813, now seen corresponding path program 215 times [2025-04-13 22:22:04,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:04,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583711165] [2025-04-13 22:22:04,174 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:04,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:04,186 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:04,211 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:04,211 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:22:04,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:04,659 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:22:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:04,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583711165] [2025-04-13 22:22:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583711165] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:04,660 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106794703] [2025-04-13 22:22:04,660 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:04,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:04,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:04,661 INFO L229 MonitoredProcess]: Starting monitored process 218 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:04,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (218)] Waiting until timeout for monitored process [2025-04-13 22:22:05,157 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:05,216 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:05,216 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:22:05,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:05,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 22:22:05,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:05,418 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:05,419 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 31 treesize of output 23 [2025-04-13 22:22:05,481 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:05,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:05,690 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:05,691 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 152 treesize of output 134 [2025-04-13 22:22:05,951 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:05,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106794703] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:05,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:05,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2025-04-13 22:22:05,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276600366] [2025-04-13 22:22:05,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:05,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:22:05,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:05,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:22:05,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:22:05,952 INFO L87 Difference]: Start difference. First operand 349 states and 981 transitions. Second operand has 33 states, 32 states have (on average 1.75) internal successors, (56), 33 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:22:09,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:09,255 INFO L93 Difference]: Finished difference Result 508 states and 1331 transitions. [2025-04-13 22:22:09,255 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 22:22:09,255 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.75) internal successors, (56), 33 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:22:09,255 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:09,257 INFO L225 Difference]: With dead ends: 508 [2025-04-13 22:22:09,257 INFO L226 Difference]: Without dead ends: 477 [2025-04-13 22:22:09,257 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1003 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=402, Invalid=3888, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 22:22:09,257 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 141 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1685 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:09,257 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 0 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1685 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:22:09,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-04-13 22:22:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 353. [2025-04-13 22:22:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.8323863636363638) internal successors, (997), 352 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call 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:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 997 transitions. [2025-04-13 22:22:09,892 INFO L79 Accepts]: Start accepts. Automaton has 353 states and 997 transitions. Word has length 30 [2025-04-13 22:22:09,892 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:09,892 INFO L485 AbstractCegarLoop]: Abstraction has 353 states and 997 transitions. [2025-04-13 22:22:09,892 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.75) internal successors, (56), 33 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:22:09,892 INFO L278 IsEmpty]: Start isEmpty. Operand 353 states and 997 transitions. [2025-04-13 22:22:09,892 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:09,892 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:09,892 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:09,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (218)] Ended with exit code 0 [2025-04-13 22:22:10,093 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 218 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable223 [2025-04-13 22:22:10,093 INFO L403 AbstractCegarLoop]: === Iteration 225 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:10,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash 2000208271, now seen corresponding path program 216 times [2025-04-13 22:22:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:10,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008909881] [2025-04-13 22:22:10,093 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:10,106 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:10,123 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:10,124 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:22:10,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:10,640 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:10,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:10,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008909881] [2025-04-13 22:22:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008909881] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:10,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117338275] [2025-04-13 22:22:10,640 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:10,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:10,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:10,642 INFO L229 MonitoredProcess]: Starting monitored process 219 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:10,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (219)] Waiting until timeout for monitored process [2025-04-13 22:22:11,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:11,163 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:11,163 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:22:11,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:11,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:22:11,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:11,258 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:11,258 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 27 treesize of output 19 [2025-04-13 22:22:11,297 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:11,297 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:11,512 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:22:11,512 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 173 treesize of output 107 [2025-04-13 22:22:11,636 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:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117338275] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:11,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:11,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 33 [2025-04-13 22:22:11,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238007918] [2025-04-13 22:22:11,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:11,637 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:22:11,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:11,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:22:11,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1007, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:22:11,637 INFO L87 Difference]: Start difference. First operand 353 states and 997 transitions. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:22:13,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:13,709 INFO L93 Difference]: Finished difference Result 430 states and 1158 transitions. [2025-04-13 22:22:13,709 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:22:13,709 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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 30 [2025-04-13 22:22:13,709 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:13,711 INFO L225 Difference]: With dead ends: 430 [2025-04-13 22:22:13,711 INFO L226 Difference]: Without dead ends: 421 [2025-04-13 22:22:13,711 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=285, Invalid=2265, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:22:13,711 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 121 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:13,711 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 0 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:22:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-04-13 22:22:14,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 353. [2025-04-13 22:22:14,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.8323863636363638) internal successors, (997), 352 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call 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:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 997 transitions. [2025-04-13 22:22:14,349 INFO L79 Accepts]: Start accepts. Automaton has 353 states and 997 transitions. Word has length 30 [2025-04-13 22:22:14,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:14,350 INFO L485 AbstractCegarLoop]: Abstraction has 353 states and 997 transitions. [2025-04-13 22:22:14,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:22:14,350 INFO L278 IsEmpty]: Start isEmpty. Operand 353 states and 997 transitions. [2025-04-13 22:22:14,350 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:14,350 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:14,350 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:14,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (219)] Ended with exit code 0 [2025-04-13 22:22:14,550 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 219 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable224 [2025-04-13 22:22:14,551 INFO L403 AbstractCegarLoop]: === Iteration 226 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:14,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash -753768713, now seen corresponding path program 217 times [2025-04-13 22:22:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:14,551 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732234835] [2025-04-13 22:22:14,551 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:14,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:14,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:22:14,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:14,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:14,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:22:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:15,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732234835] [2025-04-13 22:22:15,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732234835] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:15,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921109950] [2025-04-13 22:22:15,127 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:15,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:15,129 INFO L229 MonitoredProcess]: Starting monitored process 220 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,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (220)] Waiting until timeout for monitored process [2025-04-13 22:22:15,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:22:15,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:15,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:15,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:15,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:22:15,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:15,753 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:15,753 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 35 treesize of output 23 [2025-04-13 22:22:15,782 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:15,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:16,014 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:22:16,014 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 173 treesize of output 107 [2025-04-13 22:22:16,115 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:16,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921109950] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:16,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:16,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 22:22:16,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642189453] [2025-04-13 22:22:16,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:16,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:22:16,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:16,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:22:16,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:22:16,116 INFO L87 Difference]: Start difference. First operand 353 states and 997 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:18,545 INFO L93 Difference]: Finished difference Result 457 states and 1234 transitions. [2025-04-13 22:22:18,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:22:18,546 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:18,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:18,547 INFO L225 Difference]: With dead ends: 457 [2025-04-13 22:22:18,547 INFO L226 Difference]: Without dead ends: 448 [2025-04-13 22:22:18,547 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 934 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=427, Invalid=3479, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:22:18,547 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:18,547 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 1515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:22:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-04-13 22:22:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 367. [2025-04-13 22:22:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.8360655737704916) internal successors, (1038), 366 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call 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:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1038 transitions. [2025-04-13 22:22:19,211 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 1038 transitions. Word has length 30 [2025-04-13 22:22:19,211 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:19,211 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 1038 transitions. [2025-04-13 22:22:19,211 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:19,211 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 1038 transitions. [2025-04-13 22:22:19,211 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:19,211 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:19,211 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:19,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (220)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:19,411 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable225,220 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:19,412 INFO L403 AbstractCegarLoop]: === Iteration 227 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:19,412 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash -576415319, now seen corresponding path program 218 times [2025-04-13 22:22:19,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:19,412 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888492577] [2025-04-13 22:22:19,412 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:19,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:19,439 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:19,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:19,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:22:20,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:20,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888492577] [2025-04-13 22:22:20,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888492577] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:20,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723795271] [2025-04-13 22:22:20,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:20,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:20,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:20,390 INFO L229 MonitoredProcess]: Starting monitored process 221 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:20,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (221)] Waiting until timeout for monitored process [2025-04-13 22:22:20,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:20,924 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:20,925 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:20,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:20,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:22:20,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:21,086 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:21,086 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 27 treesize of output 19 [2025-04-13 22:22:21,140 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:22:21,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:21,387 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:22:21,387 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 173 treesize of output 107 [2025-04-13 22:22:21,537 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:21,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723795271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:21,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:21,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 11] total 44 [2025-04-13 22:22:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010134727] [2025-04-13 22:22:21,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:21,537 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 22:22:21,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:21,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 22:22:21,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1802, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:22:21,538 INFO L87 Difference]: Start difference. First operand 367 states and 1038 transitions. Second operand has 45 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 45 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:24,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:24,194 INFO L93 Difference]: Finished difference Result 456 states and 1229 transitions. [2025-04-13 22:22:24,194 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:22:24,194 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 45 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 22:22:24,194 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:24,195 INFO L225 Difference]: With dead ends: 456 [2025-04-13 22:22:24,195 INFO L226 Difference]: Without dead ends: 447 [2025-04-13 22:22:24,196 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=520, Invalid=4172, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 22:22:24,196 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1910 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:24,196 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1910 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:22:24,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-04-13 22:22:24,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 367. [2025-04-13 22:22:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.841530054644809) internal successors, (1040), 366 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call 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:24,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1040 transitions. [2025-04-13 22:22:24,866 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 1040 transitions. Word has length 30 [2025-04-13 22:22:24,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:24,866 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 1040 transitions. [2025-04-13 22:22:24,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 45 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:22:24,866 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 1040 transitions. [2025-04-13 22:22:24,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:24,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:24,867 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:24,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (221)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:25,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 221 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable226 [2025-04-13 22:22:25,067 INFO L403 AbstractCegarLoop]: === Iteration 228 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:25,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:25,067 INFO L85 PathProgramCache]: Analyzing trace with hash -809179973, now seen corresponding path program 219 times [2025-04-13 22:22:25,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:25,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201783500] [2025-04-13 22:22:25,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:25,080 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:25,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:25,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:22:25,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:25,483 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,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:25,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201783500] [2025-04-13 22:22:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201783500] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:25,483 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198532994] [2025-04-13 22:22:25,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:25,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:25,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:25,485 INFO L229 MonitoredProcess]: Starting monitored process 222 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:25,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (222)] Waiting until timeout for monitored process [2025-04-13 22:22:25,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:26,033 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:26,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:22:26,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:26,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:22:26,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:26,049 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-04-13 22:22:26,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:26,137 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 27 treesize of output 19 [2025-04-13 22:22:26,183 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:26,183 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:26,949 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:26,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198532994] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:26,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:26,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 22:22:26,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863498088] [2025-04-13 22:22:26,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:26,949 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:22:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:26,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:22:26,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:22:26,950 INFO L87 Difference]: Start difference. First operand 367 states and 1040 transitions. Second operand has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:29,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:29,585 INFO L93 Difference]: Finished difference Result 454 states and 1227 transitions. [2025-04-13 22:22:29,586 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:22:29,586 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:29,586 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:29,587 INFO L225 Difference]: With dead ends: 454 [2025-04-13 22:22:29,587 INFO L226 Difference]: Without dead ends: 445 [2025-04-13 22:22:29,587 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=287, Invalid=1969, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:22:29,587 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 119 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:29,587 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 0 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:22:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2025-04-13 22:22:30,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 365. [2025-04-13 22:22:30,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 2.8324175824175826) internal successors, (1031), 364 states have internal predecessors, (1031), 0 states have call successors, (0), 0 states have call 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:30,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1031 transitions. [2025-04-13 22:22:30,265 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 1031 transitions. Word has length 30 [2025-04-13 22:22:30,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:30,265 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 1031 transitions. [2025-04-13 22:22:30,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:30,265 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 1031 transitions. [2025-04-13 22:22:30,269 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:30,269 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:30,269 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:30,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (222)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:30,470 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable227,222 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:30,470 INFO L403 AbstractCegarLoop]: === Iteration 229 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:30,470 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1152632015, now seen corresponding path program 220 times [2025-04-13 22:22:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:30,470 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686115234] [2025-04-13 22:22:30,470 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:22:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:30,483 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:30,494 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:30,494 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:22:30,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:31,131 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:31,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:31,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686115234] [2025-04-13 22:22:31,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686115234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:31,131 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556144296] [2025-04-13 22:22:31,131 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:22:31,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:31,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:31,133 INFO L229 MonitoredProcess]: Starting monitored process 223 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:31,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (223)] Waiting until timeout for monitored process [2025-04-13 22:22:31,638 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:31,663 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:31,663 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:22:31,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:31,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:22:31,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:31,768 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:31,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 35 treesize of output 23 [2025-04-13 22:22:31,820 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:31,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:32,095 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:22:32,095 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 181 treesize of output 113 [2025-04-13 22:22:32,209 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:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556144296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:32,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:32,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:22:32,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974020869] [2025-04-13 22:22:32,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:32,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:22:32,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:32,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:22:32,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1349, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:22:32,210 INFO L87 Difference]: Start difference. First operand 365 states and 1031 transitions. Second operand has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:22:34,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:34,916 INFO L93 Difference]: Finished difference Result 436 states and 1183 transitions. [2025-04-13 22:22:34,916 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:22:34,916 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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 30 [2025-04-13 22:22:34,916 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:34,918 INFO L225 Difference]: With dead ends: 436 [2025-04-13 22:22:34,918 INFO L226 Difference]: Without dead ends: 423 [2025-04-13 22:22:34,918 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=419, Invalid=3487, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 22:22:34,918 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:34,918 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 1372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:22:34,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-04-13 22:22:35,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 361. [2025-04-13 22:22:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.8194444444444446) internal successors, (1015), 360 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call 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,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1015 transitions. [2025-04-13 22:22:35,591 INFO L79 Accepts]: Start accepts. Automaton has 361 states and 1015 transitions. Word has length 30 [2025-04-13 22:22:35,591 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:35,591 INFO L485 AbstractCegarLoop]: Abstraction has 361 states and 1015 transitions. [2025-04-13 22:22:35,591 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.605263157894737) internal successors, (61), 39 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:22:35,591 INFO L278 IsEmpty]: Start isEmpty. Operand 361 states and 1015 transitions. [2025-04-13 22:22:35,592 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:35,592 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:35,592 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:35,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (223)] Ended with exit code 0 [2025-04-13 22:22:35,792 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 223 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable228 [2025-04-13 22:22:35,792 INFO L403 AbstractCegarLoop]: === Iteration 230 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:35,793 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:35,793 INFO L85 PathProgramCache]: Analyzing trace with hash 909163733, now seen corresponding path program 221 times [2025-04-13 22:22:35,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:35,793 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930527559] [2025-04-13 22:22:35,793 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:35,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:35,808 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:35,826 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:35,826 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:22:35,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:36,296 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:22:36,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:36,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930527559] [2025-04-13 22:22:36,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930527559] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:36,296 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258404615] [2025-04-13 22:22:36,296 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:22:36,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:36,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:36,298 INFO L229 MonitoredProcess]: Starting monitored process 224 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:36,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (224)] Waiting until timeout for monitored process [2025-04-13 22:22:36,807 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:36,929 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:36,929 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:22:36,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:36,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:22:36,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:37,069 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:37,070 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 31 treesize of output 23 [2025-04-13 22:22:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:22:37,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:37,344 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:22:37,344 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 173 treesize of output 107 [2025-04-13 22:22:37,441 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:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258404615] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:37,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:37,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 34 [2025-04-13 22:22:37,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306591676] [2025-04-13 22:22:37,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:37,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:22:37,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:37,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:22:37,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1072, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:22:37,442 INFO L87 Difference]: Start difference. First operand 361 states and 1015 transitions. Second operand has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 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:39,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:39,975 INFO L93 Difference]: Finished difference Result 470 states and 1252 transitions. [2025-04-13 22:22:39,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:22:39,975 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 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:39,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:39,976 INFO L225 Difference]: With dead ends: 470 [2025-04-13 22:22:39,976 INFO L226 Difference]: Without dead ends: 449 [2025-04-13 22:22:39,977 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=361, Invalid=2831, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:22:39,977 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 137 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1439 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:39,977 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 0 Invalid, 1472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1439 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:22:39,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-04-13 22:22:40,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 353. [2025-04-13 22:22:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.809659090909091) internal successors, (989), 352 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call 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:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 989 transitions. [2025-04-13 22:22:40,641 INFO L79 Accepts]: Start accepts. Automaton has 353 states and 989 transitions. Word has length 30 [2025-04-13 22:22:40,641 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:40,641 INFO L485 AbstractCegarLoop]: Abstraction has 353 states and 989 transitions. [2025-04-13 22:22:40,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 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:40,641 INFO L278 IsEmpty]: Start isEmpty. Operand 353 states and 989 transitions. [2025-04-13 22:22:40,642 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:40,642 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:40,642 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:40,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (224)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:40,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 224 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable229 [2025-04-13 22:22:40,842 INFO L403 AbstractCegarLoop]: === Iteration 231 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:40,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:40,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1081475479, now seen corresponding path program 222 times [2025-04-13 22:22:40,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:40,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873057715] [2025-04-13 22:22:40,843 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:40,855 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:40,870 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:40,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:22:40,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:41,244 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:41,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:41,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873057715] [2025-04-13 22:22:41,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873057715] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:41,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997718632] [2025-04-13 22:22:41,244 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:22:41,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:41,246 INFO L229 MonitoredProcess]: Starting monitored process 225 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:41,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (225)] Waiting until timeout for monitored process [2025-04-13 22:22:41,769 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:41,799 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:41,799 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:22:41,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:41,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:22:41,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:41,889 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:41,889 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 27 treesize of output 19 [2025-04-13 22:22:41,923 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:41,924 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:42,208 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:22:42,208 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 181 treesize of output 113 [2025-04-13 22:22:42,297 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:42,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997718632] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:42,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:42,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 22:22:42,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685848240] [2025-04-13 22:22:42,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:42,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:22:42,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:42,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:22:42,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=765, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:22:42,298 INFO L87 Difference]: Start difference. First operand 353 states and 989 transitions. Second operand has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 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:22:44,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:44,703 INFO L93 Difference]: Finished difference Result 455 states and 1227 transitions. [2025-04-13 22:22:44,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:22:44,704 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 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:22:44,704 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:44,705 INFO L225 Difference]: With dead ends: 455 [2025-04-13 22:22:44,705 INFO L226 Difference]: Without dead ends: 446 [2025-04-13 22:22:44,705 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=249, Invalid=1731, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:22:44,705 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:44,705 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:22:44,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-04-13 22:22:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 363. [2025-04-13 22:22:45,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.798342541436464) internal successors, (1013), 362 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states have call 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,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 1013 transitions. [2025-04-13 22:22:45,462 INFO L79 Accepts]: Start accepts. Automaton has 363 states and 1013 transitions. Word has length 30 [2025-04-13 22:22:45,462 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:45,462 INFO L485 AbstractCegarLoop]: Abstraction has 363 states and 1013 transitions. [2025-04-13 22:22:45,462 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 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:22:45,462 INFO L278 IsEmpty]: Start isEmpty. Operand 363 states and 1013 transitions. [2025-04-13 22:22:45,462 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:45,462 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:45,462 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:45,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (225)] Ended with exit code 0 [2025-04-13 22:22:45,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable230,225 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:45,663 INFO L403 AbstractCegarLoop]: === Iteration 232 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:45,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:45,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1656756229, now seen corresponding path program 223 times [2025-04-13 22:22:45,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:45,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880590513] [2025-04-13 22:22:45,663 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:45,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:45,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:22:45,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:45,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:45,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:46,316 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:22:46,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:46,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880590513] [2025-04-13 22:22:46,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880590513] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:46,317 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765449789] [2025-04-13 22:22:46,317 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:22:46,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:46,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:46,318 INFO L229 MonitoredProcess]: Starting monitored process 226 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:46,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (226)] Waiting until timeout for monitored process [2025-04-13 22:22:46,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:22:46,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:22:46,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:22:46,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:46,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:22:46,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:46,949 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:46,949 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 35 treesize of output 23 [2025-04-13 22:22:46,997 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:46,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:47,265 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:22:47,266 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 181 treesize of output 113 [2025-04-13 22:22:47,355 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:47,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765449789] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:47,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:47,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 22:22:47,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698530944] [2025-04-13 22:22:47,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:47,355 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:22:47,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:47,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:22:47,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:22:47,356 INFO L87 Difference]: Start difference. First operand 363 states and 1013 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:50,767 INFO L93 Difference]: Finished difference Result 497 states and 1325 transitions. [2025-04-13 22:22:50,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:22:50,767 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:50,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:50,768 INFO L225 Difference]: With dead ends: 497 [2025-04-13 22:22:50,768 INFO L226 Difference]: Without dead ends: 484 [2025-04-13 22:22:50,769 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=456, Invalid=3966, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 22:22:50,769 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:50,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:22:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-04-13 22:22:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 365. [2025-04-13 22:22:51,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 2.802197802197802) internal successors, (1020), 364 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call 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:51,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1020 transitions. [2025-04-13 22:22:51,507 INFO L79 Accepts]: Start accepts. Automaton has 365 states and 1020 transitions. Word has length 30 [2025-04-13 22:22:51,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:51,507 INFO L485 AbstractCegarLoop]: Abstraction has 365 states and 1020 transitions. [2025-04-13 22:22:51,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:51,507 INFO L278 IsEmpty]: Start isEmpty. Operand 365 states and 1020 transitions. [2025-04-13 22:22:51,508 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:51,508 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:51,508 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:51,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (226)] Ended with exit code 0 [2025-04-13 22:22:51,708 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable231,226 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:51,708 INFO L403 AbstractCegarLoop]: === Iteration 233 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:51,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash -207369903, now seen corresponding path program 224 times [2025-04-13 22:22:51,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:51,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721124477] [2025-04-13 22:22:51,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:51,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:51,738 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:51,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:51,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:52,252 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:22:52,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:52,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721124477] [2025-04-13 22:22:52,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721124477] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:52,252 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146226759] [2025-04-13 22:22:52,252 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:22:52,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:52,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:52,254 INFO L229 MonitoredProcess]: Starting monitored process 227 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:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (227)] Waiting until timeout for monitored process [2025-04-13 22:22:52,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:22:52,796 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:52,796 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:22:52,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:52,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:22:52,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:52,933 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:52,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 27 treesize of output 19 [2025-04-13 22:22:52,958 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:22:52,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:53,213 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:22:53,214 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 181 treesize of output 113 [2025-04-13 22:22:53,321 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:22:53,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146226759] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:53,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:53,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 34 [2025-04-13 22:22:53,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969921841] [2025-04-13 22:22:53,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:53,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:22:53,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:53,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:22:53,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:22:53,322 INFO L87 Difference]: Start difference. First operand 365 states and 1020 transitions. Second operand has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:22:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:22:55,936 INFO L93 Difference]: Finished difference Result 486 states and 1308 transitions. [2025-04-13 22:22:55,936 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:22:55,936 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:22:55,936 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:22:55,938 INFO L225 Difference]: With dead ends: 486 [2025-04-13 22:22:55,938 INFO L226 Difference]: Without dead ends: 477 [2025-04-13 22:22:55,938 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=2843, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 22:22:55,938 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:22:55,938 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 0 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:22:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2025-04-13 22:22:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 377. [2025-04-13 22:22:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 2.8085106382978724) internal successors, (1056), 376 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call 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:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1056 transitions. [2025-04-13 22:22:56,723 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 1056 transitions. Word has length 30 [2025-04-13 22:22:56,723 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:22:56,723 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 1056 transitions. [2025-04-13 22:22:56,723 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 35 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:22:56,723 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 1056 transitions. [2025-04-13 22:22:56,724 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:22:56,724 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:22:56,724 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:56,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (227)] Forceful destruction successful, exit code 0 [2025-04-13 22:22:56,924 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 227 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable232 [2025-04-13 22:22:56,924 INFO L403 AbstractCegarLoop]: === Iteration 234 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:22:56,924 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:22:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1636234909, now seen corresponding path program 225 times [2025-04-13 22:22:56,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:22:56,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274114604] [2025-04-13 22:22:56,925 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:56,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:22:56,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:56,952 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:56,952 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:56,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:57,371 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:57,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:22:57,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274114604] [2025-04-13 22:22:57,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274114604] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:22:57,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855296231] [2025-04-13 22:22:57,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:22:57,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:22:57,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:22:57,373 INFO L229 MonitoredProcess]: Starting monitored process 228 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:57,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (228)] Waiting until timeout for monitored process [2025-04-13 22:22:57,885 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:22:57,915 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:57,915 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:22:57,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:22:57,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:22:57,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:22:58,030 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:22:58,030 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 27 treesize of output 19 [2025-04-13 22:22:58,051 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:58,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:22:58,330 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:22:58,330 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 181 treesize of output 113 [2025-04-13 22:22:58,416 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:58,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855296231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:22:58,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:22:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-13 22:22:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565304788] [2025-04-13 22:22:58,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:22:58,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:22:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:22:58,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:22:58,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:22:58,417 INFO L87 Difference]: Start difference. First operand 377 states and 1056 transitions. Second operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:23:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:00,772 INFO L93 Difference]: Finished difference Result 460 states and 1251 transitions. [2025-04-13 22:23:00,772 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:23:00,772 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:23:00,772 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:00,774 INFO L225 Difference]: With dead ends: 460 [2025-04-13 22:23:00,774 INFO L226 Difference]: Without dead ends: 451 [2025-04-13 22:23:00,774 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=2098, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:23:00,774 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:00,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:23:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-04-13 22:23:01,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 381. [2025-04-13 22:23:01,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.8157894736842106) internal successors, (1070), 380 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call 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:01,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1070 transitions. [2025-04-13 22:23:01,570 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 1070 transitions. Word has length 30 [2025-04-13 22:23:01,570 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:01,570 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 1070 transitions. [2025-04-13 22:23:01,570 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:23:01,570 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 1070 transitions. [2025-04-13 22:23:01,571 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:01,571 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:01,571 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:01,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (228)] Ended with exit code 0 [2025-04-13 22:23:01,771 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 228 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable233 [2025-04-13 22:23:01,771 INFO L403 AbstractCegarLoop]: === Iteration 235 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:01,772 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1925118963, now seen corresponding path program 226 times [2025-04-13 22:23:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:01,772 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643638346] [2025-04-13 22:23:01,772 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:01,790 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:01,802 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:01,802 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:01,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:23:02,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:02,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643638346] [2025-04-13 22:23:02,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643638346] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:02,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963222941] [2025-04-13 22:23:02,430 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:02,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:02,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:02,432 INFO L229 MonitoredProcess]: Starting monitored process 229 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:02,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (229)] Waiting until timeout for monitored process [2025-04-13 22:23:02,959 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:02,983 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:02,983 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:02,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:02,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:23:02,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:03,101 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:03,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 35 treesize of output 23 [2025-04-13 22:23:03,131 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:23:03,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:03,410 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:23:03,410 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 181 treesize of output 113 [2025-04-13 22:23:03,523 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:23:03,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963222941] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:03,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:03,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 22:23:03,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992026954] [2025-04-13 22:23:03,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:03,524 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:23:03,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:03,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:23:03,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:23:03,524 INFO L87 Difference]: Start difference. First operand 381 states and 1070 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:23:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:06,539 INFO L93 Difference]: Finished difference Result 484 states and 1317 transitions. [2025-04-13 22:23:06,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:23:06,539 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:23:06,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:06,540 INFO L225 Difference]: With dead ends: 484 [2025-04-13 22:23:06,540 INFO L226 Difference]: Without dead ends: 475 [2025-04-13 22:23:06,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=432, Invalid=3728, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:23:06,541 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 160 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:06,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 0 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:23:06,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-04-13 22:23:07,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 381. [2025-04-13 22:23:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.8157894736842106) internal successors, (1070), 380 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call 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:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1070 transitions. [2025-04-13 22:23:07,336 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 1070 transitions. Word has length 30 [2025-04-13 22:23:07,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:07,336 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 1070 transitions. [2025-04-13 22:23:07,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:23:07,336 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 1070 transitions. [2025-04-13 22:23:07,337 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:07,337 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:07,337 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:07,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (229)] Ended with exit code 0 [2025-04-13 22:23:07,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 229 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable234 [2025-04-13 22:23:07,537 INFO L403 AbstractCegarLoop]: === Iteration 236 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:07,538 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:07,538 INFO L85 PathProgramCache]: Analyzing trace with hash 948119079, now seen corresponding path program 227 times [2025-04-13 22:23:07,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:07,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27087449] [2025-04-13 22:23:07,538 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:07,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:07,551 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:07,571 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:07,571 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:23:07,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:08,133 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:23:08,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:08,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27087449] [2025-04-13 22:23:08,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27087449] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:08,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240391285] [2025-04-13 22:23:08,133 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:08,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:08,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:08,135 INFO L229 MonitoredProcess]: Starting monitored process 230 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:08,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (230)] Waiting until timeout for monitored process [2025-04-13 22:23:08,663 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:08,737 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:08,737 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:23:08,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:08,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:23:08,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:08,952 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:08,953 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 31 treesize of output 23 [2025-04-13 22:23:08,986 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:23:08,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:09,338 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:23:09,338 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 181 treesize of output 113 [2025-04-13 22:23:09,431 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:23:09,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240391285] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:09,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:09,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 37 [2025-04-13 22:23:09,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395125975] [2025-04-13 22:23:09,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:09,431 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:23:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:09,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:23:09,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:23:09,431 INFO L87 Difference]: Start difference. First operand 381 states and 1070 transitions. Second operand has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 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:23:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:12,551 INFO L93 Difference]: Finished difference Result 480 states and 1283 transitions. [2025-04-13 22:23:12,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:23:12,551 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 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:23:12,551 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:12,553 INFO L225 Difference]: With dead ends: 480 [2025-04-13 22:23:12,553 INFO L226 Difference]: Without dead ends: 471 [2025-04-13 22:23:12,553 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=356, Invalid=3676, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:23:12,553 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:12,553 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:23:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-04-13 22:23:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 385. [2025-04-13 22:23:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 2.8229166666666665) internal successors, (1084), 384 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call 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:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1084 transitions. [2025-04-13 22:23:13,372 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1084 transitions. Word has length 30 [2025-04-13 22:23:13,372 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:13,373 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1084 transitions. [2025-04-13 22:23:13,373 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 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:23:13,373 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1084 transitions. [2025-04-13 22:23:13,373 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:13,373 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:13,373 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:13,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (230)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:13,573 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable235,230 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:13,574 INFO L403 AbstractCegarLoop]: === Iteration 237 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:13,574 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:13,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1980530223, now seen corresponding path program 228 times [2025-04-13 22:23:13,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:13,574 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253099899] [2025-04-13 22:23:13,574 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:13,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:13,587 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:13,605 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:13,606 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:23:13,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:14,024 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:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:14,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253099899] [2025-04-13 22:23:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253099899] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:14,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862913826] [2025-04-13 22:23:14,025 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:14,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:14,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:14,026 INFO L229 MonitoredProcess]: Starting monitored process 231 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,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (231)] Waiting until timeout for monitored process [2025-04-13 22:23:14,551 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:14,631 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:14,631 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:23:14,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:14,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-13 22:23:14,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:14,791 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:14,792 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 27 treesize of output 19 [2025-04-13 22:23:14,822 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:23:14,822 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:15,014 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:15,014 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 152 treesize of output 134 [2025-04-13 22:23:15,229 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:15,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862913826] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:15,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:15,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 11] total 31 [2025-04-13 22:23:15,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600715651] [2025-04-13 22:23:15,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:15,229 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:23:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:15,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:23:15,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=886, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:23:15,230 INFO L87 Difference]: Start difference. First operand 385 states and 1084 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:23:17,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:17,941 INFO L93 Difference]: Finished difference Result 503 states and 1365 transitions. [2025-04-13 22:23:17,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:23:17,941 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:23:17,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:17,942 INFO L225 Difference]: With dead ends: 503 [2025-04-13 22:23:17,942 INFO L226 Difference]: Without dead ends: 490 [2025-04-13 22:23:17,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 709 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=278, Invalid=2478, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:23:17,943 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:17,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 1784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:23:17,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-04-13 22:23:18,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 381. [2025-04-13 22:23:18,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.8157894736842106) internal successors, (1070), 380 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call 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:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1070 transitions. [2025-04-13 22:23:18,741 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 1070 transitions. Word has length 30 [2025-04-13 22:23:18,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:18,741 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 1070 transitions. [2025-04-13 22:23:18,741 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:23:18,741 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 1070 transitions. [2025-04-13 22:23:18,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:18,742 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:18,742 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:18,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (231)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:18,942 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 231 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable236 [2025-04-13 22:23:18,942 INFO L403 AbstractCegarLoop]: === Iteration 238 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:18,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:18,943 INFO L85 PathProgramCache]: Analyzing trace with hash -769629981, now seen corresponding path program 229 times [2025-04-13 22:23:18,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:18,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604024069] [2025-04-13 22:23:18,943 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:23:18,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:18,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:23:18,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:18,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:23:18,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:19,514 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:19,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:19,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604024069] [2025-04-13 22:23:19,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604024069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:19,514 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567400736] [2025-04-13 22:23:19,514 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:23:19,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:19,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:19,516 INFO L229 MonitoredProcess]: Starting monitored process 232 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:19,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (232)] Waiting until timeout for monitored process [2025-04-13 22:23:20,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:23:20,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:20,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:23:20,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:20,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:23:20,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:20,174 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:20,175 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 35 treesize of output 23 [2025-04-13 22:23:20,204 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:20,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:20,547 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:23:20,547 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 181 treesize of output 113 [2025-04-13 22:23:20,639 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:20,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567400736] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:20,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:20,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:23:20,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610222961] [2025-04-13 22:23:20,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:20,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:23:20,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:20,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:23:20,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:23:20,640 INFO L87 Difference]: Start difference. First operand 381 states and 1070 transitions. Second operand has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:23:23,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:23,401 INFO L93 Difference]: Finished difference Result 470 states and 1260 transitions. [2025-04-13 22:23:23,401 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:23:23,401 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:23:23,401 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:23,402 INFO L225 Difference]: With dead ends: 470 [2025-04-13 22:23:23,402 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 22:23:23,403 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=382, Invalid=3278, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:23:23,403 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1181 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:23,403 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 22:23:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 381. [2025-04-13 22:23:24,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.8157894736842106) internal successors, (1070), 380 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call 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:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1070 transitions. [2025-04-13 22:23:24,196 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 1070 transitions. Word has length 30 [2025-04-13 22:23:24,196 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:24,196 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 1070 transitions. [2025-04-13 22:23:24,196 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:23:24,196 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 1070 transitions. [2025-04-13 22:23:24,197 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:24,197 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:24,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:23:24,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (232)] Ended with exit code 0 [2025-04-13 22:23:24,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 232 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable237 [2025-04-13 22:23:24,397 INFO L403 AbstractCegarLoop]: === Iteration 239 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:24,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1466860817, now seen corresponding path program 230 times [2025-04-13 22:23:24,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:24,398 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874805009] [2025-04-13 22:23:24,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:24,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:24,425 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:24,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:24,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:23:25,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:25,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874805009] [2025-04-13 22:23:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874805009] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:25,197 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410311960] [2025-04-13 22:23:25,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:25,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:25,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:25,199 INFO L229 MonitoredProcess]: Starting monitored process 233 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:25,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (233)] Waiting until timeout for monitored process [2025-04-13 22:23:25,731 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:25,757 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:25,758 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:25,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:25,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:23:25,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:25,910 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:25,910 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 27 treesize of output 19 [2025-04-13 22:23:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:23:25,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:26,182 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:23:26,182 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 173 treesize of output 107 [2025-04-13 22:23:26,330 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:26,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410311960] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:26,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:26,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 11] total 40 [2025-04-13 22:23:26,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136556835] [2025-04-13 22:23:26,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:26,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 22:23:26,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:26,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 22:23:26,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1491, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:23:26,331 INFO L87 Difference]: Start difference. First operand 381 states and 1070 transitions. Second operand has 41 states, 40 states have (on average 1.625) internal successors, (65), 41 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:23:29,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:29,491 INFO L93 Difference]: Finished difference Result 513 states and 1384 transitions. [2025-04-13 22:23:29,491 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:23:29,491 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.625) internal successors, (65), 41 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:23:29,491 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:29,493 INFO L225 Difference]: With dead ends: 513 [2025-04-13 22:23:29,493 INFO L226 Difference]: Without dead ends: 500 [2025-04-13 22:23:29,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 850 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=410, Invalid=3622, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:23:29,493 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:29,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 1736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:23:29,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2025-04-13 22:23:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 375. [2025-04-13 22:23:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 2.8155080213903743) internal successors, (1053), 374 states have internal predecessors, (1053), 0 states have call successors, (0), 0 states have call 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,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1053 transitions. [2025-04-13 22:23:30,281 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 1053 transitions. Word has length 30 [2025-04-13 22:23:30,281 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:30,281 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 1053 transitions. [2025-04-13 22:23:30,281 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.625) internal successors, (65), 41 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:23:30,281 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 1053 transitions. [2025-04-13 22:23:30,281 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:30,281 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:30,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:23:30,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (233)] Ended with exit code 0 [2025-04-13 22:23:30,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 233 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable238 [2025-04-13 22:23:30,482 INFO L403 AbstractCegarLoop]: === Iteration 240 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:30,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:30,482 INFO L85 PathProgramCache]: Analyzing trace with hash -825041241, now seen corresponding path program 231 times [2025-04-13 22:23:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:30,482 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158567991] [2025-04-13 22:23:30,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:23:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:30,495 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:30,516 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:30,516 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:23:30,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:30,945 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:30,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:30,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158567991] [2025-04-13 22:23:30,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158567991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:30,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [285676608] [2025-04-13 22:23:30,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:23:30,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:30,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:30,947 INFO L229 MonitoredProcess]: Starting monitored process 234 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:30,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (234)] Waiting until timeout for monitored process [2025-04-13 22:23:31,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:31,509 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:31,509 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:23:31,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:31,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:23:31,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:31,614 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:31,615 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 27 treesize of output 19 [2025-04-13 22:23:31,653 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:31,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:31,941 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:23:31,941 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 181 treesize of output 113 [2025-04-13 22:23:32,029 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:32,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [285676608] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:32,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:32,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-13 22:23:32,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887103402] [2025-04-13 22:23:32,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:32,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:23:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:32,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:23:32,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=832, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:23:32,030 INFO L87 Difference]: Start difference. First operand 375 states and 1053 transitions. Second operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:23:34,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:34,759 INFO L93 Difference]: Finished difference Result 461 states and 1240 transitions. [2025-04-13 22:23:34,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:23:34,759 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:23:34,759 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:34,761 INFO L225 Difference]: With dead ends: 461 [2025-04-13 22:23:34,761 INFO L226 Difference]: Without dead ends: 452 [2025-04-13 22:23:34,761 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=275, Invalid=2275, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:23:34,761 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:34,761 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-04-13 22:23:35,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 363. [2025-04-13 22:23:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 362 states have (on average 2.787292817679558) internal successors, (1009), 362 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call 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:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 1009 transitions. [2025-04-13 22:23:35,540 INFO L79 Accepts]: Start accepts. Automaton has 363 states and 1009 transitions. Word has length 30 [2025-04-13 22:23:35,540 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:35,540 INFO L485 AbstractCegarLoop]: Abstraction has 363 states and 1009 transitions. [2025-04-13 22:23:35,540 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:23:35,540 INFO L278 IsEmpty]: Start isEmpty. Operand 363 states and 1009 transitions. [2025-04-13 22:23:35,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:35,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:35,541 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:35,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (234)] Ended with exit code 0 [2025-04-13 22:23:35,741 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable239,234 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:35,741 INFO L403 AbstractCegarLoop]: === Iteration 241 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:35,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:35,742 INFO L85 PathProgramCache]: Analyzing trace with hash 961800657, now seen corresponding path program 232 times [2025-04-13 22:23:35,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:35,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009273879] [2025-04-13 22:23:35,742 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:35,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:35,754 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:35,766 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:35,766 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:35,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:36,405 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:36,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:36,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009273879] [2025-04-13 22:23:36,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009273879] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:36,406 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869136904] [2025-04-13 22:23:36,406 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:23:36,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:36,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:36,408 INFO L229 MonitoredProcess]: Starting monitored process 235 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:36,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (235)] Waiting until timeout for monitored process [2025-04-13 22:23:36,938 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:36,963 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:36,963 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:23:36,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:36,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:23:36,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:37,064 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:37,064 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 35 treesize of output 23 [2025-04-13 22:23:37,114 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:37,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:37,401 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:23:37,402 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 181 treesize of output 113 [2025-04-13 22:23:37,492 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:37,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869136904] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:37,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:37,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 22:23:37,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768802741] [2025-04-13 22:23:37,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:37,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:23:37,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:37,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:23:37,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1277, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:23:37,493 INFO L87 Difference]: Start difference. First operand 363 states and 1009 transitions. Second operand has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:23:40,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:40,658 INFO L93 Difference]: Finished difference Result 450 states and 1208 transitions. [2025-04-13 22:23:40,659 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 22:23:40,659 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:23:40,659 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:40,660 INFO L225 Difference]: With dead ends: 450 [2025-04-13 22:23:40,660 INFO L226 Difference]: Without dead ends: 437 [2025-04-13 22:23:40,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=445, Invalid=3715, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:23:40,661 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 159 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:40,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 0 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:23:40,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-04-13 22:23:41,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 361. [2025-04-13 22:23:41,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 360 states have (on average 2.783333333333333) internal successors, (1002), 360 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call 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:41,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 1002 transitions. [2025-04-13 22:23:41,424 INFO L79 Accepts]: Start accepts. Automaton has 361 states and 1002 transitions. Word has length 30 [2025-04-13 22:23:41,424 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:41,424 INFO L485 AbstractCegarLoop]: Abstraction has 361 states and 1002 transitions. [2025-04-13 22:23:41,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 38 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:23:41,424 INFO L278 IsEmpty]: Start isEmpty. Operand 361 states and 1002 transitions. [2025-04-13 22:23:41,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:41,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:41,424 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:41,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (235)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:41,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable240,235 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:41,625 INFO L403 AbstractCegarLoop]: === Iteration 242 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:41,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:41,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1317497727, now seen corresponding path program 233 times [2025-04-13 22:23:41,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:41,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938632890] [2025-04-13 22:23:41,625 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:41,639 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:41,661 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:41,661 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:23:41,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:42,177 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:23:42,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:42,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938632890] [2025-04-13 22:23:42,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938632890] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:42,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664213081] [2025-04-13 22:23:42,177 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:23:42,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:42,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:42,179 INFO L229 MonitoredProcess]: Starting monitored process 236 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:42,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (236)] Waiting until timeout for monitored process [2025-04-13 22:23:42,716 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:42,815 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:42,815 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:23:42,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:42,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-04-13 22:23:42,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:43,026 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:43,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 27 treesize of output 19 [2025-04-13 22:23:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:23:43,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:43,340 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:23:43,340 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 181 treesize of output 113 [2025-04-13 22:23:43,449 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:23:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664213081] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:43,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:43,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 36 [2025-04-13 22:23:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402643470] [2025-04-13 22:23:43,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:43,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:23:43,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:43,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:23:43,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1207, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:23:43,450 INFO L87 Difference]: Start difference. First operand 361 states and 1002 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:23:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:45,959 INFO L93 Difference]: Finished difference Result 438 states and 1182 transitions. [2025-04-13 22:23:45,959 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:23:45,960 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:23:45,960 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:45,961 INFO L225 Difference]: With dead ends: 438 [2025-04-13 22:23:45,961 INFO L226 Difference]: Without dead ends: 429 [2025-04-13 22:23:45,961 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=3097, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 22:23:45,961 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 109 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1365 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:45,961 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 0 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:45,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-04-13 22:23:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 367. [2025-04-13 22:23:46,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 366 states have (on average 2.7950819672131146) internal successors, (1023), 366 states have internal predecessors, (1023), 0 states have call successors, (0), 0 states have call 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:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1023 transitions. [2025-04-13 22:23:46,742 INFO L79 Accepts]: Start accepts. Automaton has 367 states and 1023 transitions. Word has length 30 [2025-04-13 22:23:46,742 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:46,742 INFO L485 AbstractCegarLoop]: Abstraction has 367 states and 1023 transitions. [2025-04-13 22:23:46,742 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:23:46,742 INFO L278 IsEmpty]: Start isEmpty. Operand 367 states and 1023 transitions. [2025-04-13 22:23:46,743 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:46,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:46,743 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:46,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (236)] Ended with exit code 0 [2025-04-13 22:23:46,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable241,236 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:46,943 INFO L403 AbstractCegarLoop]: === Iteration 243 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:46,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:46,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1326932595, now seen corresponding path program 234 times [2025-04-13 22:23:46,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:46,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944902065] [2025-04-13 22:23:46,944 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:46,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:46,957 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:46,979 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:46,979 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:23:46,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:47,779 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:23:47,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:47,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944902065] [2025-04-13 22:23:47,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944902065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:47,779 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635363717] [2025-04-13 22:23:47,779 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:23:47,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:47,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:47,781 INFO L229 MonitoredProcess]: Starting monitored process 237 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:47,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (237)] Waiting until timeout for monitored process [2025-04-13 22:23:48,317 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:23:48,400 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:48,401 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:23:48,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:48,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:23:48,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:48,559 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 22:23:48,559 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 39 treesize of output 19 [2025-04-13 22:23:48,593 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:23:48,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:48,755 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:48,755 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 148 treesize of output 128 [2025-04-13 22:23:48,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:23:48,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635363717] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:48,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:48,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13, 11] total 37 [2025-04-13 22:23:48,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057530259] [2025-04-13 22:23:48,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:48,983 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 22:23:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:48,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 22:23:48,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1270, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:23:48,984 INFO L87 Difference]: Start difference. First operand 367 states and 1023 transitions. Second operand has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 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:23:52,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:52,043 INFO L93 Difference]: Finished difference Result 510 states and 1364 transitions. [2025-04-13 22:23:52,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:23:52,044 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 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:23:52,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:52,045 INFO L225 Difference]: With dead ends: 510 [2025-04-13 22:23:52,045 INFO L226 Difference]: Without dead ends: 501 [2025-04-13 22:23:52,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=415, Invalid=4007, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 22:23:52,046 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 117 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:52,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 0 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:23:52,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2025-04-13 22:23:52,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 385. [2025-04-13 22:23:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 2.8229166666666665) internal successors, (1084), 384 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call 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,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1084 transitions. [2025-04-13 22:23:52,870 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1084 transitions. Word has length 30 [2025-04-13 22:23:52,870 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:52,870 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1084 transitions. [2025-04-13 22:23:52,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 38 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:23:52,870 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1084 transitions. [2025-04-13 22:23:52,871 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:52,871 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:52,871 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,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (237)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:53,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable242,237 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:53,071 INFO L403 AbstractCegarLoop]: === Iteration 244 === 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,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:53,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1259720509, now seen corresponding path program 235 times [2025-04-13 22:23:53,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:53,072 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618593855] [2025-04-13 22:23:53,072 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:23:53,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:53,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:23:53,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:53,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:23:53,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:53,656 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:53,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:53,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618593855] [2025-04-13 22:23:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618593855] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:53,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376323245] [2025-04-13 22:23:53,656 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:23:53,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:53,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:53,658 INFO L229 MonitoredProcess]: Starting monitored process 238 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,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (238)] Waiting until timeout for monitored process [2025-04-13 22:23:54,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:23:54,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:23:54,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:23:54,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:54,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:23:54,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:54,324 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:54,324 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 35 treesize of output 23 [2025-04-13 22:23:54,353 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:54,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:54,630 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:23:54,631 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 181 treesize of output 113 [2025-04-13 22:23:54,734 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:54,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376323245] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:54,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:54,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:23:54,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944877195] [2025-04-13 22:23:54,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:54,734 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:23:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:54,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:23:54,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1344, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:23:54,735 INFO L87 Difference]: Start difference. First operand 385 states and 1084 transitions. Second operand has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:23:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:23:57,376 INFO L93 Difference]: Finished difference Result 464 states and 1257 transitions. [2025-04-13 22:23:57,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:23:57,376 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:23:57,376 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:23:57,377 INFO L225 Difference]: With dead ends: 464 [2025-04-13 22:23:57,377 INFO L226 Difference]: Without dead ends: 455 [2025-04-13 22:23:57,378 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=397, Invalid=3385, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 22:23:57,378 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:23:57,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:23:57,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-04-13 22:23:58,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 385. [2025-04-13 22:23:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 2.8229166666666665) internal successors, (1084), 384 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call 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:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1084 transitions. [2025-04-13 22:23:58,202 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1084 transitions. Word has length 30 [2025-04-13 22:23:58,202 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:23:58,202 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1084 transitions. [2025-04-13 22:23:58,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:23:58,202 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1084 transitions. [2025-04-13 22:23:58,202 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:23:58,202 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:23:58,202 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:58,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (238)] Forceful destruction successful, exit code 0 [2025-04-13 22:23:58,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 238 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable243 [2025-04-13 22:23:58,403 INFO L403 AbstractCegarLoop]: === Iteration 245 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:23:58,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:23:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1271521335, now seen corresponding path program 236 times [2025-04-13 22:23:58,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:23:58,403 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827297479] [2025-04-13 22:23:58,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:58,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:23:58,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:58,430 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:58,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:58,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:58,936 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:58,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:23:58,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827297479] [2025-04-13 22:23:58,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827297479] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:23:58,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649791913] [2025-04-13 22:23:58,936 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:23:58,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:23:58,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:23:58,938 INFO L229 MonitoredProcess]: Starting monitored process 239 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:58,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (239)] Waiting until timeout for monitored process [2025-04-13 22:23:59,471 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:23:59,498 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:59,498 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:23:59,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:23:59,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:23:59,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:23:59,595 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:23:59,596 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 27 treesize of output 19 [2025-04-13 22:23:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:23:59,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:23:59,845 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:23:59,845 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 173 treesize of output 107 [2025-04-13 22:23:59,964 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:59,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649791913] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:23:59,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:23:59,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 33 [2025-04-13 22:23:59,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134336922] [2025-04-13 22:23:59,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:23:59,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:23:59,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:23:59,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:23:59,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:23:59,965 INFO L87 Difference]: Start difference. First operand 385 states and 1084 transitions. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:24:02,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:02,848 INFO L93 Difference]: Finished difference Result 507 states and 1374 transitions. [2025-04-13 22:24:02,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:24:02,849 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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 30 [2025-04-13 22:24:02,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:02,850 INFO L225 Difference]: With dead ends: 507 [2025-04-13 22:24:02,850 INFO L226 Difference]: Without dead ends: 498 [2025-04-13 22:24:02,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=320, Invalid=2542, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:24:02,851 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:02,851 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 0 Invalid, 1893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1867 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:24:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-04-13 22:24:03,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 385. [2025-04-13 22:24:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 2.8229166666666665) internal successors, (1084), 384 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call 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:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1084 transitions. [2025-04-13 22:24:03,714 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1084 transitions. Word has length 30 [2025-04-13 22:24:03,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:03,714 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1084 transitions. [2025-04-13 22:24:03,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:24:03,714 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1084 transitions. [2025-04-13 22:24:03,714 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:03,714 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:03,715 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:03,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (239)] Forceful destruction successful, exit code 0 [2025-04-13 22:24:03,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable244,239 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:03,915 INFO L403 AbstractCegarLoop]: === Iteration 246 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:03,915 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:03,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1204309249, now seen corresponding path program 237 times [2025-04-13 22:24:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:03,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238674127] [2025-04-13 22:24:03,915 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:03,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:03,947 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:03,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:24:03,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:04,344 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:04,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:04,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238674127] [2025-04-13 22:24:04,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238674127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:04,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550700051] [2025-04-13 22:24:04,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:04,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:04,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:04,346 INFO L229 MonitoredProcess]: Starting monitored process 240 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:04,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (240)] Waiting until timeout for monitored process [2025-04-13 22:24:04,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:04,930 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:04,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:24:04,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:04,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:24:04,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:05,037 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:05,037 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 27 treesize of output 19 [2025-04-13 22:24:05,074 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:05,074 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:05,322 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:24:05,323 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 181 treesize of output 113 [2025-04-13 22:24:05,423 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:05,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550700051] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:05,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:05,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 22:24:05,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711280092] [2025-04-13 22:24:05,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:05,424 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:24:05,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:05,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:24:05,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:24:05,424 INFO L87 Difference]: Start difference. First operand 385 states and 1084 transitions. Second operand has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:07,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:07,825 INFO L93 Difference]: Finished difference Result 458 states and 1246 transitions. [2025-04-13 22:24:07,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:24:07,825 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:07,825 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:07,826 INFO L225 Difference]: With dead ends: 458 [2025-04-13 22:24:07,826 INFO L226 Difference]: Without dead ends: 449 [2025-04-13 22:24:07,827 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=2073, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 22:24:07,827 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:07,827 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:24:07,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-04-13 22:24:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 381. [2025-04-13 22:24:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.8157894736842106) internal successors, (1070), 380 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call 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,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1070 transitions. [2025-04-13 22:24:08,642 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 1070 transitions. Word has length 30 [2025-04-13 22:24:08,642 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:08,642 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 1070 transitions. [2025-04-13 22:24:08,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.7419354838709677) internal successors, (54), 32 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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,642 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 1070 transitions. [2025-04-13 22:24:08,643 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:08,643 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:08,643 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,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (240)] Ended with exit code 0 [2025-04-13 22:24:08,843 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 240 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable245 [2025-04-13 22:24:08,843 INFO L403 AbstractCegarLoop]: === Iteration 247 === 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,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:08,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1305102255, now seen corresponding path program 238 times [2025-04-13 22:24:08,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:08,844 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816187610] [2025-04-13 22:24:08,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:08,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:08,857 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:24:08,868 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:08,869 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:08,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:09,460 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:09,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:09,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816187610] [2025-04-13 22:24:09,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816187610] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:09,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525126795] [2025-04-13 22:24:09,460 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:09,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:09,462 INFO L229 MonitoredProcess]: Starting monitored process 241 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,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (241)] Waiting until timeout for monitored process [2025-04-13 22:24:10,005 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:24:10,031 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:10,031 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:10,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:10,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:24:10,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:10,125 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:10,125 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 35 treesize of output 23 [2025-04-13 22:24:10,172 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:10,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:10,369 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:24:10,370 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 173 treesize of output 107 [2025-04-13 22:24:10,473 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:10,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525126795] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:10,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:10,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2025-04-13 22:24:10,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875569300] [2025-04-13 22:24:10,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:10,473 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:24:10,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:10,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:24:10,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1200, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:24:10,474 INFO L87 Difference]: Start difference. First operand 381 states and 1070 transitions. Second operand has 37 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 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:24:13,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:13,460 INFO L93 Difference]: Finished difference Result 507 states and 1367 transitions. [2025-04-13 22:24:13,460 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:24:13,460 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 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:24:13,460 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:13,461 INFO L225 Difference]: With dead ends: 507 [2025-04-13 22:24:13,461 INFO L226 Difference]: Without dead ends: 498 [2025-04-13 22:24:13,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=410, Invalid=3250, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:24:13,462 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 153 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:13,462 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 0 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:24:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-04-13 22:24:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 375. [2025-04-13 22:24:14,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 2.804812834224599) internal successors, (1049), 374 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call 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:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1049 transitions. [2025-04-13 22:24:14,264 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 1049 transitions. Word has length 30 [2025-04-13 22:24:14,264 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:14,264 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 1049 transitions. [2025-04-13 22:24:14,264 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 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:24:14,264 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 1049 transitions. [2025-04-13 22:24:14,265 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:14,265 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:14,265 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:14,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (241)] Ended with exit code 0 [2025-04-13 22:24:14,465 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 241 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable246 [2025-04-13 22:24:14,465 INFO L403 AbstractCegarLoop]: === Iteration 248 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:14,465 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash 216804771, now seen corresponding path program 239 times [2025-04-13 22:24:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:14,465 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422461642] [2025-04-13 22:24:14,465 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:14,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:14,479 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:14,505 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:14,505 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:24:14,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:15,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422461642] [2025-04-13 22:24:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422461642] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:15,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031476288] [2025-04-13 22:24:15,224 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:15,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:15,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:15,226 INFO L229 MonitoredProcess]: Starting monitored process 242 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:15,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (242)] Waiting until timeout for monitored process [2025-04-13 22:24:15,768 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:15,899 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:15,900 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:24:15,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:15,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-13 22:24:15,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:16,117 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:16,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 31 treesize of output 23 [2025-04-13 22:24:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:24:16,163 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:16,420 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:16,420 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 154 treesize of output 119 [2025-04-13 22:24:16,680 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:16,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031476288] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:16,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14, 11] total 41 [2025-04-13 22:24:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099769457] [2025-04-13 22:24:16,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:16,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 22:24:16,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:16,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 22:24:16,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1572, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:24:16,681 INFO L87 Difference]: Start difference. First operand 375 states and 1049 transitions. Second operand has 42 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 42 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:24:19,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:19,389 INFO L93 Difference]: Finished difference Result 482 states and 1306 transitions. [2025-04-13 22:24:19,389 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 22:24:19,389 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 42 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:24:19,389 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:19,390 INFO L225 Difference]: With dead ends: 482 [2025-04-13 22:24:19,390 INFO L226 Difference]: Without dead ends: 473 [2025-04-13 22:24:19,391 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=358, Invalid=3674, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:24:19,391 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 125 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:19,391 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 0 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:24:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-04-13 22:24:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 393. [2025-04-13 22:24:20,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 392 states have (on average 2.826530612244898) internal successors, (1108), 392 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call 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:20,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 1108 transitions. [2025-04-13 22:24:20,256 INFO L79 Accepts]: Start accepts. Automaton has 393 states and 1108 transitions. Word has length 30 [2025-04-13 22:24:20,256 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:20,256 INFO L485 AbstractCegarLoop]: Abstraction has 393 states and 1108 transitions. [2025-04-13 22:24:20,256 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.6585365853658536) internal successors, (68), 42 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:24:20,256 INFO L278 IsEmpty]: Start isEmpty. Operand 393 states and 1108 transitions. [2025-04-13 22:24:20,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:20,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:20,256 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:20,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (242)] Ended with exit code 0 [2025-04-13 22:24:20,456 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable247,242 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:20,457 INFO L403 AbstractCegarLoop]: === Iteration 249 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:20,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:20,457 INFO L85 PathProgramCache]: Analyzing trace with hash 423945079, now seen corresponding path program 240 times [2025-04-13 22:24:20,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:20,457 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664207092] [2025-04-13 22:24:20,457 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:20,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:20,470 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:20,487 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:20,487 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:24:20,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:20,933 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:24:20,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:20,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664207092] [2025-04-13 22:24:20,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664207092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:20,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649954735] [2025-04-13 22:24:20,933 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:20,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:20,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:20,935 INFO L229 MonitoredProcess]: Starting monitored process 243 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:20,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (243)] Waiting until timeout for monitored process [2025-04-13 22:24:21,502 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:21,535 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:21,535 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:24:21,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:21,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:24:21,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:21,717 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:21,717 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 27 treesize of output 19 [2025-04-13 22:24:21,763 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:21,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:22,032 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:24:22,033 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 181 treesize of output 113 [2025-04-13 22:24:22,145 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:22,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649954735] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:22,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:22,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 38 [2025-04-13 22:24:22,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267968762] [2025-04-13 22:24:22,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:22,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:24:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:22,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:24:22,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:24:22,146 INFO L87 Difference]: Start difference. First operand 393 states and 1108 transitions. Second operand has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 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:24:24,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:24,593 INFO L93 Difference]: Finished difference Result 462 states and 1256 transitions. [2025-04-13 22:24:24,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 22:24:24,594 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 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:24:24,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:24,595 INFO L225 Difference]: With dead ends: 462 [2025-04-13 22:24:24,595 INFO L226 Difference]: Without dead ends: 449 [2025-04-13 22:24:24,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=341, Invalid=2629, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:24:24,595 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:24,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:24:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-04-13 22:24:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 389. [2025-04-13 22:24:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.814432989690722) internal successors, (1092), 388 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call 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:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1092 transitions. [2025-04-13 22:24:25,450 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 1092 transitions. Word has length 30 [2025-04-13 22:24:25,450 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:25,450 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 1092 transitions. [2025-04-13 22:24:25,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.7894736842105263) internal successors, (68), 39 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:24:25,450 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 1092 transitions. [2025-04-13 22:24:25,451 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:25,451 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:25,451 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:25,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (243)] Forceful destruction successful, exit code 0 [2025-04-13 22:24:25,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable248,243 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:25,651 INFO L403 AbstractCegarLoop]: === Iteration 250 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:25,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:25,651 INFO L85 PathProgramCache]: Analyzing trace with hash 161393511, now seen corresponding path program 241 times [2025-04-13 22:24:25,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:25,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914437868] [2025-04-13 22:24:25,652 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:25,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:25,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:24:25,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:25,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:25,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:26,241 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:24:26,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:26,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914437868] [2025-04-13 22:24:26,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914437868] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:26,241 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318512813] [2025-04-13 22:24:26,241 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:24:26,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:26,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:26,243 INFO L229 MonitoredProcess]: Starting monitored process 244 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:26,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (244)] Waiting until timeout for monitored process [2025-04-13 22:24:26,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:24:26,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:26,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:24:26,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:26,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:24:26,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:26,892 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:26,893 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 35 treesize of output 23 [2025-04-13 22:24:26,937 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:26,937 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:27,155 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:24:27,155 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 173 treesize of output 107 [2025-04-13 22:24:27,270 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:27,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318512813] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:27,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:27,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:24:27,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219390103] [2025-04-13 22:24:27,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:27,271 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:24:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:27,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:24:27,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1337, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:24:27,271 INFO L87 Difference]: Start difference. First operand 389 states and 1092 transitions. Second operand has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:29,974 INFO L93 Difference]: Finished difference Result 482 states and 1295 transitions. [2025-04-13 22:24:29,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:24:29,975 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:29,975 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:29,976 INFO L225 Difference]: With dead ends: 482 [2025-04-13 22:24:29,976 INFO L226 Difference]: Without dead ends: 473 [2025-04-13 22:24:29,976 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 941 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=382, Invalid=3158, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:24:29,976 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:29,976 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:24:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2025-04-13 22:24:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 389. [2025-04-13 22:24:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.814432989690722) internal successors, (1092), 388 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call 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:30,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1092 transitions. [2025-04-13 22:24:30,837 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 1092 transitions. Word has length 30 [2025-04-13 22:24:30,837 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:30,837 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 1092 transitions. [2025-04-13 22:24:30,837 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:30,837 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 1092 transitions. [2025-04-13 22:24:30,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:30,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:30,838 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:30,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (244)] Ended with exit code 0 [2025-04-13 22:24:31,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable249,244 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:31,038 INFO L403 AbstractCegarLoop]: === Iteration 251 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:31,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1810162415, now seen corresponding path program 242 times [2025-04-13 22:24:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:31,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375191521] [2025-04-13 22:24:31,039 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:31,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:31,052 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:24:31,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:31,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:31,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:31,658 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:24:31,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:31,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375191521] [2025-04-13 22:24:31,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375191521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:31,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909118199] [2025-04-13 22:24:31,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:24:31,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:31,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:31,660 INFO L229 MonitoredProcess]: Starting monitored process 245 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:31,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (245)] Waiting until timeout for monitored process [2025-04-13 22:24:32,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:24:32,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:32,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:24:32,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:32,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:24:32,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:32,390 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:32,391 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 27 treesize of output 19 [2025-04-13 22:24:32,450 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:24:32,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:32,786 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:24:32,786 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 181 treesize of output 113 [2025-04-13 22:24:32,883 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:32,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909118199] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:32,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:32,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 33 [2025-04-13 22:24:32,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486631535] [2025-04-13 22:24:32,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:32,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:24:32,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:32,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:24:32,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:24:32,885 INFO L87 Difference]: Start difference. First operand 389 states and 1092 transitions. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:24:36,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:36,148 INFO L93 Difference]: Finished difference Result 492 states and 1326 transitions. [2025-04-13 22:24:36,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:24:36,149 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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 30 [2025-04-13 22:24:36,149 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:36,150 INFO L225 Difference]: With dead ends: 492 [2025-04-13 22:24:36,150 INFO L226 Difference]: Without dead ends: 479 [2025-04-13 22:24:36,150 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=317, Invalid=2763, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:24:36,150 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:36,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:24:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-04-13 22:24:37,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 383. [2025-04-13 22:24:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 2.8141361256544504) internal successors, (1075), 382 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call 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:37,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1075 transitions. [2025-04-13 22:24:37,004 INFO L79 Accepts]: Start accepts. Automaton has 383 states and 1075 transitions. Word has length 30 [2025-04-13 22:24:37,004 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:37,004 INFO L485 AbstractCegarLoop]: Abstraction has 383 states and 1075 transitions. [2025-04-13 22:24:37,004 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:24:37,004 INFO L278 IsEmpty]: Start isEmpty. Operand 383 states and 1075 transitions. [2025-04-13 22:24:37,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:37,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:37,004 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:37,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (245)] Ended with exit code 0 [2025-04-13 22:24:37,204 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable250,245 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:37,205 INFO L403 AbstractCegarLoop]: === Iteration 252 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:37,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:37,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1879737217, now seen corresponding path program 243 times [2025-04-13 22:24:37,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:37,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48137234] [2025-04-13 22:24:37,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:37,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:37,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:37,237 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:37,237 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:24:37,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:37,598 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:37,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:37,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48137234] [2025-04-13 22:24:37,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48137234] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:37,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824538167] [2025-04-13 22:24:37,598 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:24:37,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:37,600 INFO L229 MonitoredProcess]: Starting monitored process 246 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:37,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (246)] Waiting until timeout for monitored process [2025-04-13 22:24:38,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:38,243 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:38,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 22:24:38,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:38,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:24:38,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:38,328 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:38,328 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 27 treesize of output 19 [2025-04-13 22:24:38,362 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:38,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:38,572 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:24:38,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 173 treesize of output 107 [2025-04-13 22:24:38,679 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:38,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824538167] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:38,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:38,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 30 [2025-04-13 22:24:38,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575909415] [2025-04-13 22:24:38,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:38,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:24:38,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:38,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:24:38,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:24:38,680 INFO L87 Difference]: Start difference. First operand 383 states and 1075 transitions. Second operand has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:24:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:41,133 INFO L93 Difference]: Finished difference Result 483 states and 1291 transitions. [2025-04-13 22:24:41,133 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:24:41,134 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:24:41,134 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:41,135 INFO L225 Difference]: With dead ends: 483 [2025-04-13 22:24:41,135 INFO L226 Difference]: Without dead ends: 474 [2025-04-13 22:24:41,135 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=307, Invalid=1949, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:24:41,135 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:41,135 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:24:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-04-13 22:24:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 381. [2025-04-13 22:24:41,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 380 states have (on average 2.8157894736842106) internal successors, (1070), 380 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call 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:41,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 1070 transitions. [2025-04-13 22:24:41,990 INFO L79 Accepts]: Start accepts. Automaton has 381 states and 1070 transitions. Word has length 30 [2025-04-13 22:24:41,990 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:41,990 INFO L485 AbstractCegarLoop]: Abstraction has 381 states and 1070 transitions. [2025-04-13 22:24:41,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 31 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:24:41,990 INFO L278 IsEmpty]: Start isEmpty. Operand 381 states and 1070 transitions. [2025-04-13 22:24:41,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:41,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:41,990 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:42,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (246)] Forceful destruction successful, exit code 0 [2025-04-13 22:24:42,191 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable251,246 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:42,191 INFO L403 AbstractCegarLoop]: === Iteration 253 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:42,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:42,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1367596847, now seen corresponding path program 244 times [2025-04-13 22:24:42,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:42,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511405564] [2025-04-13 22:24:42,191 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:42,206 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:24:42,221 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:42,221 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:42,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:42,803 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:24:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:42,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511405564] [2025-04-13 22:24:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511405564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:42,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056256718] [2025-04-13 22:24:42,804 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:24:42,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:42,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:42,805 INFO L229 MonitoredProcess]: Starting monitored process 247 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:42,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (247)] Waiting until timeout for monitored process [2025-04-13 22:24:43,367 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:24:43,392 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:24:43,392 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:24:43,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:43,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:24:43,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:43,506 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:43,506 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 35 treesize of output 23 [2025-04-13 22:24:43,535 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:24:43,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:43,764 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:24:43,764 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 173 treesize of output 107 [2025-04-13 22:24:43,846 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:24:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056256718] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:43,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:43,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2025-04-13 22:24:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131769108] [2025-04-13 22:24:43,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:43,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:24:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:43,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:24:43,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1208, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:24:43,847 INFO L87 Difference]: Start difference. First operand 381 states and 1070 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:47,065 INFO L93 Difference]: Finished difference Result 521 states and 1411 transitions. [2025-04-13 22:24:47,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 22:24:47,065 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:47,065 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:47,066 INFO L225 Difference]: With dead ends: 521 [2025-04-13 22:24:47,066 INFO L226 Difference]: Without dead ends: 512 [2025-04-13 22:24:47,067 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=405, Invalid=3627, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 22:24:47,067 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1813 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:47,067 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 1850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1813 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:24:47,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-04-13 22:24:47,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 389. [2025-04-13 22:24:47,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 2.829896907216495) internal successors, (1098), 388 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call 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:47,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1098 transitions. [2025-04-13 22:24:47,936 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 1098 transitions. Word has length 30 [2025-04-13 22:24:47,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:47,936 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 1098 transitions. [2025-04-13 22:24:47,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:47,936 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 1098 transitions. [2025-04-13 22:24:47,936 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:47,936 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:47,936 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:47,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (247)] Ended with exit code 0 [2025-04-13 22:24:48,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable252,247 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:48,137 INFO L403 AbstractCegarLoop]: === Iteration 254 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:48,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:48,137 INFO L85 PathProgramCache]: Analyzing trace with hash -686182745, now seen corresponding path program 245 times [2025-04-13 22:24:48,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:48,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786912115] [2025-04-13 22:24:48,137 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:48,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:48,151 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:48,168 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:48,169 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:24:48,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:48,642 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:24:48,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:48,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786912115] [2025-04-13 22:24:48,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786912115] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:48,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782497408] [2025-04-13 22:24:48,642 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:24:48,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:48,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:48,644 INFO L229 MonitoredProcess]: Starting monitored process 248 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:48,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (248)] Waiting until timeout for monitored process [2025-04-13 22:24:49,211 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:49,379 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:49,379 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:24:49,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:49,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:24:49,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:49,536 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:49,536 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 31 treesize of output 23 [2025-04-13 22:24:49,586 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:24:49,586 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:49,862 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:24:49,863 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 181 treesize of output 113 [2025-04-13 22:24:49,950 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:49,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782497408] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:49,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:49,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 34 [2025-04-13 22:24:49,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447648812] [2025-04-13 22:24:49,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:49,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:24:49,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:49,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:24:49,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:24:49,951 INFO L87 Difference]: Start difference. First operand 389 states and 1098 transitions. Second operand has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 35 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:52,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:52,742 INFO L93 Difference]: Finished difference Result 474 states and 1274 transitions. [2025-04-13 22:24:52,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:24:52,742 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 35 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:52,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:52,743 INFO L225 Difference]: With dead ends: 474 [2025-04-13 22:24:52,743 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 22:24:52,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=349, Invalid=2731, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:24:52,744 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:52,744 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1188 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:24:52,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 22:24:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 385. [2025-04-13 22:24:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 2.8177083333333335) internal successors, (1082), 384 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:24:53,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1082 transitions. [2025-04-13 22:24:53,607 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1082 transitions. Word has length 30 [2025-04-13 22:24:53,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:24:53,607 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1082 transitions. [2025-04-13 22:24:53,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 35 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:53,607 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1082 transitions. [2025-04-13 22:24:53,607 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:24:53,607 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:24:53,607 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,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (248)] Ended with exit code 0 [2025-04-13 22:24:53,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable253,248 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:53,808 INFO L403 AbstractCegarLoop]: === Iteration 255 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:24:53,808 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:24:53,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1423008107, now seen corresponding path program 246 times [2025-04-13 22:24:53,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:24:53,808 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290024622] [2025-04-13 22:24:53,808 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:53,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:24:53,823 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:53,841 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:53,841 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:24:53,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:24:54,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:24:54,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290024622] [2025-04-13 22:24:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290024622] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:24:54,818 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574503314] [2025-04-13 22:24:54,818 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:24:54,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:24:54,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:24:54,820 INFO L229 MonitoredProcess]: Starting monitored process 249 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,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (249)] Waiting until timeout for monitored process [2025-04-13 22:24:55,392 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:24:55,426 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:55,426 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:24:55,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:24:55,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:24:55,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:24:55,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:24:55,548 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 27 treesize of output 19 [2025-04-13 22:24:55,601 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:55,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:24:55,840 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:24:55,840 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 173 treesize of output 107 [2025-04-13 22:24:55,975 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:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574503314] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:24:55,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:24:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 11] total 41 [2025-04-13 22:24:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576914916] [2025-04-13 22:24:55,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:24:55,975 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 22:24:55,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:24:55,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 22:24:55,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:24:55,976 INFO L87 Difference]: Start difference. First operand 385 states and 1082 transitions. Second operand has 42 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 42 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:24:59,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:24:59,626 INFO L93 Difference]: Finished difference Result 522 states and 1399 transitions. [2025-04-13 22:24:59,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 22:24:59,627 INFO L79 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 42 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:24:59,627 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:24:59,628 INFO L225 Difference]: With dead ends: 522 [2025-04-13 22:24:59,628 INFO L226 Difference]: Without dead ends: 513 [2025-04-13 22:24:59,628 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=565, Invalid=4547, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 22:24:59,629 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:24:59,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:24:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2025-04-13 22:25:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 385. [2025-04-13 22:25:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 2.8177083333333335) internal successors, (1082), 384 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:25:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1082 transitions. [2025-04-13 22:25:00,506 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1082 transitions. Word has length 30 [2025-04-13 22:25:00,507 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:00,507 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1082 transitions. [2025-04-13 22:25:00,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 42 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:00,507 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1082 transitions. [2025-04-13 22:25:00,507 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:00,507 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:00,507 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:00,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (249)] Ended with exit code 0 [2025-04-13 22:25:00,707 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 249 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable254 [2025-04-13 22:25:00,708 INFO L403 AbstractCegarLoop]: === Iteration 256 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:00,708 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:00,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1374677057, now seen corresponding path program 247 times [2025-04-13 22:25:00,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:00,708 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837154760] [2025-04-13 22:25:00,708 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:00,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:00,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:25:00,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:00,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:00,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:01,404 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:25:01,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:01,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837154760] [2025-04-13 22:25:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837154760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:01,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172434891] [2025-04-13 22:25:01,404 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:01,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:01,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:01,407 INFO L229 MonitoredProcess]: Starting monitored process 250 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:01,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (250)] Waiting until timeout for monitored process [2025-04-13 22:25:01,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 22:25:02,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:02,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:02,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:02,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:25:02,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:02,112 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:02,112 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 35 treesize of output 23 [2025-04-13 22:25:02,159 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:02,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:02,481 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:25:02,482 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 181 treesize of output 113 [2025-04-13 22:25:02,582 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:02,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172434891] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:02,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:02,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 38 [2025-04-13 22:25:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553492143] [2025-04-13 22:25:02,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:02,583 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 22:25:02,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:02,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 22:25:02,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1346, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 22:25:02,583 INFO L87 Difference]: Start difference. First operand 385 states and 1082 transitions. Second operand has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:06,116 INFO L93 Difference]: Finished difference Result 497 states and 1336 transitions. [2025-04-13 22:25:06,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:25:06,118 INFO L79 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:06,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:06,119 INFO L225 Difference]: With dead ends: 497 [2025-04-13 22:25:06,119 INFO L226 Difference]: Without dead ends: 484 [2025-04-13 22:25:06,120 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1051 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=433, Invalid=3727, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 22:25:06,120 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 149 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1387 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:06,120 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 0 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1387 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:25:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-04-13 22:25:06,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 379. [2025-04-13 22:25:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 2.8174603174603177) internal successors, (1065), 378 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call 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,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1065 transitions. [2025-04-13 22:25:06,978 INFO L79 Accepts]: Start accepts. Automaton has 379 states and 1065 transitions. Word has length 30 [2025-04-13 22:25:06,978 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:06,978 INFO L485 AbstractCegarLoop]: Abstraction has 379 states and 1065 transitions. [2025-04-13 22:25:06,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 39 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:06,979 INFO L278 IsEmpty]: Start isEmpty. Operand 379 states and 1065 transitions. [2025-04-13 22:25:06,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:06,979 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:06,979 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,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (250)] Ended with exit code 0 [2025-04-13 22:25:07,179 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 250 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable255 [2025-04-13 22:25:07,180 INFO L403 AbstractCegarLoop]: === Iteration 257 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:07,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:07,180 INFO L85 PathProgramCache]: Analyzing trace with hash 295335599, now seen corresponding path program 248 times [2025-04-13 22:25:07,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:07,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043786086] [2025-04-13 22:25:07,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:07,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:07,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:25:07,208 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,208 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:07,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:07,804 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:25:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:07,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043786086] [2025-04-13 22:25:07,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043786086] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:07,805 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094606960] [2025-04-13 22:25:07,805 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:07,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:07,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:07,807 INFO L229 MonitoredProcess]: Starting monitored process 251 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,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (251)] Waiting until timeout for monitored process [2025-04-13 22:25:08,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:25:08,420 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:08,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:08,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:08,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:25:08,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:08,519 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:08,519 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 27 treesize of output 19 [2025-04-13 22:25:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:25:08,561 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:08,776 INFO L325 Elim1Store]: treesize reduction 15, result has 80.5 percent of original size [2025-04-13 22:25:08,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 173 treesize of output 107 [2025-04-13 22:25:08,894 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:25:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094606960] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:08,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:08,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 33 [2025-04-13 22:25:08,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783664846] [2025-04-13 22:25:08,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:08,895 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:25:08,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:08,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:25:08,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:25:08,896 INFO L87 Difference]: Start difference. First operand 379 states and 1065 transitions. Second operand has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:25:12,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:12,107 INFO L93 Difference]: Finished difference Result 535 states and 1435 transitions. [2025-04-13 22:25:12,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 22:25:12,107 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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 30 [2025-04-13 22:25:12,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:12,109 INFO L225 Difference]: With dead ends: 535 [2025-04-13 22:25:12,109 INFO L226 Difference]: Without dead ends: 522 [2025-04-13 22:25:12,110 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=2738, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:25:12,110 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:12,110 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:25:12,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2025-04-13 22:25:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 377. [2025-04-13 22:25:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 2.8191489361702127) internal successors, (1060), 376 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:25:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1060 transitions. [2025-04-13 22:25:12,961 INFO L79 Accepts]: Start accepts. Automaton has 377 states and 1060 transitions. Word has length 30 [2025-04-13 22:25:12,962 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:12,962 INFO L485 AbstractCegarLoop]: Abstraction has 377 states and 1060 transitions. [2025-04-13 22:25:12,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 34 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:25:12,962 INFO L278 IsEmpty]: Start isEmpty. Operand 377 states and 1060 transitions. [2025-04-13 22:25:12,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:12,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:12,962 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:12,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (251)] Ended with exit code 0 [2025-04-13 22:25:13,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 251 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable256 [2025-04-13 22:25:13,163 INFO L403 AbstractCegarLoop]: === Iteration 258 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:13,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1281266053, now seen corresponding path program 249 times [2025-04-13 22:25:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:13,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500928250] [2025-04-13 22:25:13,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:13,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:25:13,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:25:13,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:25:13,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:13,606 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:25:13,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:13,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500928250] [2025-04-13 22:25:13,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500928250] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:13,606 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412647746] [2025-04-13 22:25:13,606 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:13,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:13,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:13,608 INFO L229 MonitoredProcess]: Starting monitored process 252 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:13,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (252)] Waiting until timeout for monitored process [2025-04-13 22:25:14,173 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:25:14,200 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 22:25:14,200 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:25:14,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:14,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:25:14,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:14,301 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:14,301 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 27 treesize of output 19 [2025-04-13 22:25:14,359 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:25:14,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:14,568 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:14,569 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 144 treesize of output 123 [2025-04-13 22:25:14,750 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:25:14,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412647746] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:14,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:14,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 22:25:14,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391694402] [2025-04-13 22:25:14,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:14,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 22:25:14,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:14,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 22:25:14,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2025-04-13 22:25:14,751 INFO L87 Difference]: Start difference. First operand 377 states and 1060 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:25:17,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:17,528 INFO L93 Difference]: Finished difference Result 498 states and 1338 transitions. [2025-04-13 22:25:17,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:25:17,528 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:25:17,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:17,530 INFO L225 Difference]: With dead ends: 498 [2025-04-13 22:25:17,530 INFO L226 Difference]: Without dead ends: 476 [2025-04-13 22:25:17,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=1610, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 22:25:17,530 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 92 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:17,530 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 0 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:25:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-04-13 22:25:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 383. [2025-04-13 22:25:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 2.8141361256544504) internal successors, (1075), 382 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call 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:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1075 transitions. [2025-04-13 22:25:18,402 INFO L79 Accepts]: Start accepts. Automaton has 383 states and 1075 transitions. Word has length 30 [2025-04-13 22:25:18,402 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:18,402 INFO L485 AbstractCegarLoop]: Abstraction has 383 states and 1075 transitions. [2025-04-13 22:25:18,402 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:25:18,402 INFO L278 IsEmpty]: Start isEmpty. Operand 383 states and 1075 transitions. [2025-04-13 22:25:18,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:18,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:18,402 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:18,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (252)] Ended with exit code 0 [2025-04-13 22:25:18,603 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 252 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable257 [2025-04-13 22:25:18,603 INFO L403 AbstractCegarLoop]: === Iteration 259 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:18,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash -209724561, now seen corresponding path program 250 times [2025-04-13 22:25:18,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:18,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214621862] [2025-04-13 22:25:18,603 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:18,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:18,617 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:25:18,631 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:18,631 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:18,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:25:19,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:19,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214621862] [2025-04-13 22:25:19,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214621862] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:19,312 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119715059] [2025-04-13 22:25:19,312 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:19,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:19,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:19,314 INFO L229 MonitoredProcess]: Starting monitored process 253 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:19,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (253)] Waiting until timeout for monitored process [2025-04-13 22:25:19,884 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 22:25:19,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 22:25:19,909 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:19,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:19,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 22:25:19,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:20,025 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:20,025 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 35 treesize of output 23 [2025-04-13 22:25:20,077 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:25:20,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:20,410 INFO L325 Elim1Store]: treesize reduction 15, result has 81.9 percent of original size [2025-04-13 22:25:20,410 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 181 treesize of output 113 [2025-04-13 22:25:20,469 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:25:20,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119715059] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:20,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:20,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2025-04-13 22:25:20,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242908765] [2025-04-13 22:25:20,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:20,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:25:20,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:20,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:25:20,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1214, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:25:20,470 INFO L87 Difference]: Start difference. First operand 383 states and 1075 transitions. Second operand has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:25:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:23,095 INFO L93 Difference]: Finished difference Result 441 states and 1209 transitions. [2025-04-13 22:25:23,095 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 22:25:23,095 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:25:23,095 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:23,097 INFO L225 Difference]: With dead ends: 441 [2025-04-13 22:25:23,097 INFO L226 Difference]: Without dead ends: 432 [2025-04-13 22:25:23,097 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=298, Invalid=2252, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:25:23,097 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:23,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:25:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-04-13 22:25:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 383. [2025-04-13 22:25:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 2.8141361256544504) internal successors, (1075), 382 states have internal predecessors, (1075), 0 states have call successors, (0), 0 states have call 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:23,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 1075 transitions. [2025-04-13 22:25:23,971 INFO L79 Accepts]: Start accepts. Automaton has 383 states and 1075 transitions. Word has length 30 [2025-04-13 22:25:23,971 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:23,971 INFO L485 AbstractCegarLoop]: Abstraction has 383 states and 1075 transitions. [2025-04-13 22:25:23,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 37 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:25:23,971 INFO L278 IsEmpty]: Start isEmpty. Operand 383 states and 1075 transitions. [2025-04-13 22:25:23,972 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 22:25:23,972 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:23,972 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:23,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (253)] Ended with exit code 0 [2025-04-13 22:25:24,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable258,253 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:24,172 INFO L403 AbstractCegarLoop]: === Iteration 260 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:24,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:24,172 INFO L85 PathProgramCache]: Analyzing trace with hash -831347209, now seen corresponding path program 251 times [2025-04-13 22:25:24,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:24,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064429013] [2025-04-13 22:25:24,172 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:24,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:24,187 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:25:24,204 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:24,204 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:25:24,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:24,766 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:25:24,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:24,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064429013] [2025-04-13 22:25:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064429013] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:24,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095158932] [2025-04-13 22:25:24,767 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:24,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:24,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:24,769 INFO L229 MonitoredProcess]: Starting monitored process 254 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:24,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (254)] Waiting until timeout for monitored process [2025-04-13 22:25:25,335 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 22:25:25,383 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:25,384 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:25:25,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:25,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 22:25:25,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:25,555 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:25:25,555 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 31 treesize of output 23 [2025-04-13 22:25:25,607 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:25:25,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:25,991 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:25:25,991 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 134 treesize of output 83 [2025-04-13 22:25:26,018 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:25:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095158932] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:26,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:26,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 11] total 33 [2025-04-13 22:25:26,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163227074] [2025-04-13 22:25:26,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:26,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:25:26,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:26,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:25:26,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:25:26,019 INFO L87 Difference]: Start difference. First operand 383 states and 1075 transitions. Second operand has 34 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 34 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:25:28,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:28,934 INFO L93 Difference]: Finished difference Result 488 states and 1318 transitions. [2025-04-13 22:25:28,934 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:25:28,934 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 34 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:25:28,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:28,936 INFO L225 Difference]: With dead ends: 488 [2025-04-13 22:25:28,936 INFO L226 Difference]: Without dead ends: 479 [2025-04-13 22:25:28,936 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=250, Invalid=1912, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:25:28,936 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:28,936 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:25:28,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-04-13 22:25:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 392. [2025-04-13 22:25:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 391 states have (on average 2.8005115089514065) internal successors, (1095), 391 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call 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:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1095 transitions. [2025-04-13 22:25:29,810 INFO L79 Accepts]: Start accepts. Automaton has 392 states and 1095 transitions. Word has length 30 [2025-04-13 22:25:29,810 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:29,810 INFO L485 AbstractCegarLoop]: Abstraction has 392 states and 1095 transitions. [2025-04-13 22:25:29,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 34 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:25:29,810 INFO L278 IsEmpty]: Start isEmpty. Operand 392 states and 1095 transitions. [2025-04-13 22:25:29,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:25:29,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:29,811 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:29,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (254)] Ended with exit code 0 [2025-04-13 22:25:30,011 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 254 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable259 [2025-04-13 22:25:30,011 INFO L403 AbstractCegarLoop]: === Iteration 261 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:30,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1610629968, now seen corresponding path program 252 times [2025-04-13 22:25:30,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:30,012 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524539070] [2025-04-13 22:25:30,012 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:30,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:30,027 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:25:30,048 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:30,048 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:25:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:25:30,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:30,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524539070] [2025-04-13 22:25:30,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524539070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:30,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35130091] [2025-04-13 22:25:30,585 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:25:30,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:30,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:30,587 INFO L229 MonitoredProcess]: Starting monitored process 255 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:30,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (255)] Waiting until timeout for monitored process [2025-04-13 22:25:31,170 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:25:31,208 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:31,208 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:25:31,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:31,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:25:31,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:25:31,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:31,515 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:25:31,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 73 treesize of output 94 [2025-04-13 22:25:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35130091] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:31,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:31,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 34 [2025-04-13 22:25:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005044795] [2025-04-13 22:25:31,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:31,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:25:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:31,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:25:31,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:25:31,599 INFO L87 Difference]: Start difference. First operand 392 states and 1095 transitions. Second operand has 34 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 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:25:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:33,867 INFO L93 Difference]: Finished difference Result 440 states and 1184 transitions. [2025-04-13 22:25:33,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:25:33,867 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 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 31 [2025-04-13 22:25:33,867 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:33,868 INFO L225 Difference]: With dead ends: 440 [2025-04-13 22:25:33,868 INFO L226 Difference]: Without dead ends: 419 [2025-04-13 22:25:33,869 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=2584, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:25:33,869 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:33,869 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-04-13 22:25:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 400. [2025-04-13 22:25:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 2.789473684210526) internal successors, (1113), 399 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call 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:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1113 transitions. [2025-04-13 22:25:34,784 INFO L79 Accepts]: Start accepts. Automaton has 400 states and 1113 transitions. Word has length 31 [2025-04-13 22:25:34,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:34,784 INFO L485 AbstractCegarLoop]: Abstraction has 400 states and 1113 transitions. [2025-04-13 22:25:34,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 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:25:34,784 INFO L278 IsEmpty]: Start isEmpty. Operand 400 states and 1113 transitions. [2025-04-13 22:25:34,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:25:34,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:34,784 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:34,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (255)] Ended with exit code 0 [2025-04-13 22:25:34,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable260,255 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:34,985 INFO L403 AbstractCegarLoop]: === Iteration 262 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:34,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:34,985 INFO L85 PathProgramCache]: Analyzing trace with hash -553937066, now seen corresponding path program 253 times [2025-04-13 22:25:34,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:34,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776243675] [2025-04-13 22:25:34,985 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:34,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:34,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:25:35,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:35,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:35,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:35,537 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:25:35,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:35,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776243675] [2025-04-13 22:25:35,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776243675] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:35,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18806605] [2025-04-13 22:25:35,538 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:25:35,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:35,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:35,541 INFO L229 MonitoredProcess]: Starting monitored process 256 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:35,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (256)] Waiting until timeout for monitored process [2025-04-13 22:25:36,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:25:36,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:36,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:25:36,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:36,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:25:36,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:36,277 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:36,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:36,391 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:25:36,391 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 67 treesize of output 71 [2025-04-13 22:25:36,406 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:36,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18806605] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:36,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:36,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 33 [2025-04-13 22:25:36,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756138178] [2025-04-13 22:25:36,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:36,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:25:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:36,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:25:36,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:25:36,407 INFO L87 Difference]: Start difference. First operand 400 states and 1113 transitions. Second operand has 33 states, 33 states have (on average 1.606060606060606) internal successors, (53), 33 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:25:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:38,924 INFO L93 Difference]: Finished difference Result 482 states and 1298 transitions. [2025-04-13 22:25:38,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:25:38,925 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.606060606060606) internal successors, (53), 33 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 31 [2025-04-13 22:25:38,925 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:38,926 INFO L225 Difference]: With dead ends: 482 [2025-04-13 22:25:38,926 INFO L226 Difference]: Without dead ends: 465 [2025-04-13 22:25:38,926 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=1740, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:25:38,926 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:38,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:38,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-04-13 22:25:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 398. [2025-04-13 22:25:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.790931989924433) internal successors, (1108), 397 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call 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:39,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1108 transitions. [2025-04-13 22:25:39,841 INFO L79 Accepts]: Start accepts. Automaton has 398 states and 1108 transitions. Word has length 31 [2025-04-13 22:25:39,841 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:39,841 INFO L485 AbstractCegarLoop]: Abstraction has 398 states and 1108 transitions. [2025-04-13 22:25:39,841 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.606060606060606) internal successors, (53), 33 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:25:39,841 INFO L278 IsEmpty]: Start isEmpty. Operand 398 states and 1108 transitions. [2025-04-13 22:25:39,841 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:25:39,841 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:39,841 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:39,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (256)] Forceful destruction successful, exit code 0 [2025-04-13 22:25:40,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable261,256 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:40,042 INFO L403 AbstractCegarLoop]: === Iteration 263 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:40,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1854297079, now seen corresponding path program 254 times [2025-04-13 22:25:40,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:40,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517013573] [2025-04-13 22:25:40,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:40,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:40,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:25:40,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:40,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:40,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 35 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:25:40,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:40,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517013573] [2025-04-13 22:25:40,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517013573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:40,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837624634] [2025-04-13 22:25:40,747 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:25:40,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:40,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:40,749 INFO L229 MonitoredProcess]: Starting monitored process 257 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:40,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (257)] Waiting until timeout for monitored process [2025-04-13 22:25:41,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:25:41,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:41,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:25:41,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:41,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:25:41,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:25:41,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:41,815 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:25:41,815 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:25:41,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:41,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837624634] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:41,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:41,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 11] total 41 [2025-04-13 22:25:41,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889136746] [2025-04-13 22:25:41,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:41,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 22:25:41,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:41,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 22:25:41,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1457, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:25:41,938 INFO L87 Difference]: Start difference. First operand 398 states and 1108 transitions. Second operand has 41 states, 41 states have (on average 1.6585365853658536) 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:25:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:44,474 INFO L93 Difference]: Finished difference Result 470 states and 1282 transitions. [2025-04-13 22:25:44,475 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:25:44,475 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6585365853658536) 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 31 [2025-04-13 22:25:44,475 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:44,476 INFO L225 Difference]: With dead ends: 470 [2025-04-13 22:25:44,476 INFO L226 Difference]: Without dead ends: 462 [2025-04-13 22:25:44,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=389, Invalid=3271, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 22:25:44,477 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 103 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:44,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 0 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:25:44,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2025-04-13 22:25:45,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 406. [2025-04-13 22:25:45,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.8098765432098767) internal successors, (1138), 405 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call 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,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1138 transitions. [2025-04-13 22:25:45,443 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1138 transitions. Word has length 31 [2025-04-13 22:25:45,443 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:45,443 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1138 transitions. [2025-04-13 22:25:45,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.6585365853658536) 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:25:45,443 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1138 transitions. [2025-04-13 22:25:45,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:25:45,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:45,443 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:45,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (257)] Ended with exit code 0 [2025-04-13 22:25:45,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable262,257 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:45,646 INFO L403 AbstractCegarLoop]: === Iteration 264 === 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,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 896911873, now seen corresponding path program 255 times [2025-04-13 22:25:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:45,646 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181222804] [2025-04-13 22:25:45,646 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:45,660 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:25:45,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 22:25:45,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:25:45,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:46,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:46,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181222804] [2025-04-13 22:25:46,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181222804] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:46,037 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282393773] [2025-04-13 22:25:46,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:25:46,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:46,039 INFO L229 MonitoredProcess]: Starting monitored process 258 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,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (258)] Waiting until timeout for monitored process [2025-04-13 22:25:46,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:25:46,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 22:25:46,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:25:46,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:46,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 22:25:46,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:46,904 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:46,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:47,036 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:25:47,037 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 36 treesize of output 52 [2025-04-13 22:25:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:47,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282393773] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:47,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:47,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 22:25:47,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709668777] [2025-04-13 22:25:47,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:47,091 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:25:47,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:47,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:25:47,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:25:47,091 INFO L87 Difference]: Start difference. First operand 406 states and 1138 transitions. Second operand has 32 states, 32 states have (on average 1.84375) 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:25:49,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:49,578 INFO L93 Difference]: Finished difference Result 497 states and 1358 transitions. [2025-04-13 22:25:49,578 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 22:25:49,578 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.84375) 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 31 [2025-04-13 22:25:49,578 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:49,579 INFO L225 Difference]: With dead ends: 497 [2025-04-13 22:25:49,579 INFO L226 Difference]: Without dead ends: 489 [2025-04-13 22:25:49,580 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 22:25:49,580 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:49,580 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 0 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:49,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-04-13 22:25:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 406. [2025-04-13 22:25:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 2.8098765432098767) internal successors, (1138), 405 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call 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:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1138 transitions. [2025-04-13 22:25:50,541 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1138 transitions. Word has length 31 [2025-04-13 22:25:50,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:50,541 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1138 transitions. [2025-04-13 22:25:50,541 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.84375) 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:25:50,541 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1138 transitions. [2025-04-13 22:25:50,541 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:25:50,541 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:50,541 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:50,551 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (258)] Ended with exit code 0 [2025-04-13 22:25:50,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable263,258 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:50,742 INFO L403 AbstractCegarLoop]: === Iteration 265 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:50,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash -957111960, now seen corresponding path program 256 times [2025-04-13 22:25:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:50,742 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974542318] [2025-04-13 22:25:50,742 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:50,757 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:25:50,772 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:50,772 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:50,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:51,366 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:25:51,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:51,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974542318] [2025-04-13 22:25:51,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974542318] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:51,366 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833991941] [2025-04-13 22:25:51,366 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:25:51,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:51,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:51,368 INFO L229 MonitoredProcess]: Starting monitored process 259 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:51,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (259)] Waiting until timeout for monitored process [2025-04-13 22:25:51,946 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:25:51,973 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:51,973 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:25:51,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:51,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:25:51,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:52,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:52,254 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:25:52,254 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 73 treesize of output 94 [2025-04-13 22:25:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:52,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833991941] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:52,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:52,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 36 [2025-04-13 22:25:52,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756377450] [2025-04-13 22:25:52,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:52,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 22:25:52,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:52,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 22:25:52,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 22:25:52,330 INFO L87 Difference]: Start difference. First operand 406 states and 1138 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 36 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:25:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:54,660 INFO L93 Difference]: Finished difference Result 452 states and 1230 transitions. [2025-04-13 22:25:54,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 22:25:54,660 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 36 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 31 [2025-04-13 22:25:54,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:54,662 INFO L225 Difference]: With dead ends: 452 [2025-04-13 22:25:54,662 INFO L226 Difference]: Without dead ends: 433 [2025-04-13 22:25:54,662 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=2585, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 22:25:54,662 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:54,662 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-04-13 22:25:55,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 410. [2025-04-13 22:25:55,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.806845965770171) internal successors, (1148), 409 states have internal predecessors, (1148), 0 states have call successors, (0), 0 states have call 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,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1148 transitions. [2025-04-13 22:25:55,627 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1148 transitions. Word has length 31 [2025-04-13 22:25:55,627 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:25:55,627 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1148 transitions. [2025-04-13 22:25:55,627 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 36 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:25:55,627 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1148 transitions. [2025-04-13 22:25:55,628 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:25:55,628 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:25:55,628 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:25:55,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (259)] Ended with exit code 0 [2025-04-13 22:25:55,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 259 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable264 [2025-04-13 22:25:55,828 INFO L403 AbstractCegarLoop]: === Iteration 266 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:25:55,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:25:55,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1771440126, now seen corresponding path program 257 times [2025-04-13 22:25:55,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:25:55,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285931049] [2025-04-13 22:25:55,829 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:55,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:25:55,843 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:25:55,864 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:55,865 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:25:55,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:25:56,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:25:56,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285931049] [2025-04-13 22:25:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285931049] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:25:56,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31041920] [2025-04-13 22:25:56,299 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:25:56,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:25:56,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:25:56,301 INFO L229 MonitoredProcess]: Starting monitored process 260 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,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (260)] Waiting until timeout for monitored process [2025-04-13 22:25:56,888 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:25:56,951 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:25:56,951 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:25:56,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:25:56,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 22:25:56,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:25:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:25:57,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:25:57,271 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:25:57,271 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 67 treesize of output 71 [2025-04-13 22:25:57,303 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:25:57,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31041920] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:25:57,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:25:57,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 11] total 29 [2025-04-13 22:25:57,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517464769] [2025-04-13 22:25:57,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:25:57,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 22:25:57,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:25:57,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 22:25:57,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2025-04-13 22:25:57,304 INFO L87 Difference]: Start difference. First operand 410 states and 1148 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 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:25:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:25:59,902 INFO L93 Difference]: Finished difference Result 496 states and 1345 transitions. [2025-04-13 22:25:59,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 22:25:59,902 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 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 31 [2025-04-13 22:25:59,902 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:25:59,904 INFO L225 Difference]: With dead ends: 496 [2025-04-13 22:25:59,904 INFO L226 Difference]: Without dead ends: 481 [2025-04-13 22:25:59,904 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:25:59,904 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 85 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:25:59,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 0 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:25:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-04-13 22:26:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 412. [2025-04-13 22:26:00,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 2.8053527980535278) internal successors, (1153), 411 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call 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:00,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 1153 transitions. [2025-04-13 22:26:00,898 INFO L79 Accepts]: Start accepts. Automaton has 412 states and 1153 transitions. Word has length 31 [2025-04-13 22:26:00,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:00,898 INFO L485 AbstractCegarLoop]: Abstraction has 412 states and 1153 transitions. [2025-04-13 22:26:00,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 29 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:26:00,898 INFO L278 IsEmpty]: Start isEmpty. Operand 412 states and 1153 transitions. [2025-04-13 22:26:00,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:00,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:00,898 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:00,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (260)] Forceful destruction successful, exit code 0 [2025-04-13 22:26:01,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 260 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable265 [2025-04-13 22:26:01,099 INFO L403 AbstractCegarLoop]: === Iteration 267 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:01,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1734261559, now seen corresponding path program 258 times [2025-04-13 22:26:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:01,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348334307] [2025-04-13 22:26:01,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:01,113 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:01,132 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:01,133 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:26:01,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:01,590 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:26:01,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:01,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348334307] [2025-04-13 22:26:01,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348334307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:01,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948586686] [2025-04-13 22:26:01,591 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:01,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:01,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:01,592 INFO L229 MonitoredProcess]: Starting monitored process 261 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:01,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (261)] Waiting until timeout for monitored process [2025-04-13 22:26:02,191 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:02,229 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:02,229 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:26:02,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:02,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:26:02,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:02,425 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:26:02,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:02,572 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:26:02,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 46 treesize of output 83 [2025-04-13 22:26:02,643 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:02,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948586686] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:02,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:02,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 33 [2025-04-13 22:26:02,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108808984] [2025-04-13 22:26:02,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:02,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:26:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:02,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:26:02,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:26:02,644 INFO L87 Difference]: Start difference. First operand 412 states and 1153 transitions. Second operand has 33 states, 33 states have (on average 1.7878787878787878) 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:26:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:05,598 INFO L93 Difference]: Finished difference Result 528 states and 1451 transitions. [2025-04-13 22:26:05,598 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:26:05,598 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7878787878787878) 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 31 [2025-04-13 22:26:05,598 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:05,600 INFO L225 Difference]: With dead ends: 528 [2025-04-13 22:26:05,600 INFO L226 Difference]: Without dead ends: 514 [2025-04-13 22:26:05,600 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=356, Invalid=2950, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 22:26:05,600 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 81 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:05,600 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 0 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:26:05,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2025-04-13 22:26:06,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 398. [2025-04-13 22:26:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.795969773299748) internal successors, (1110), 397 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call 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:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1110 transitions. [2025-04-13 22:26:06,532 INFO L79 Accepts]: Start accepts. Automaton has 398 states and 1110 transitions. Word has length 31 [2025-04-13 22:26:06,532 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:06,532 INFO L485 AbstractCegarLoop]: Abstraction has 398 states and 1110 transitions. [2025-04-13 22:26:06,532 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7878787878787878) 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:26:06,532 INFO L278 IsEmpty]: Start isEmpty. Operand 398 states and 1110 transitions. [2025-04-13 22:26:06,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:06,532 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:06,532 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:06,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (261)] Ended with exit code 0 [2025-04-13 22:26:06,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 261 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable266 [2025-04-13 22:26:06,733 INFO L403 AbstractCegarLoop]: === Iteration 268 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:06,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -93273919, now seen corresponding path program 259 times [2025-04-13 22:26:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:06,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372224963] [2025-04-13 22:26:06,733 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:26:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:06,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:26:06,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:06,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:26:06,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:26:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:07,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372224963] [2025-04-13 22:26:07,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372224963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:07,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935827383] [2025-04-13 22:26:07,309 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:26:07,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:07,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:07,311 INFO L229 MonitoredProcess]: Starting monitored process 262 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:07,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (262)] Waiting until timeout for monitored process [2025-04-13 22:26:07,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:26:07,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:07,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:26:07,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:07,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:26:07,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:08,058 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:26:08,058 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 33 treesize of output 9 [2025-04-13 22:26:08,060 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:26:08,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:08,209 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:26:08,209 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 36 treesize of output 52 [2025-04-13 22:26:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935827383] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:08,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:08,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 33 [2025-04-13 22:26:08,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589916603] [2025-04-13 22:26:08,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:08,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:26:08,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:08,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:26:08,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:26:08,217 INFO L87 Difference]: Start difference. First operand 398 states and 1110 transitions. Second operand has 33 states, 33 states have (on average 1.6666666666666667) 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:26:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:11,087 INFO L93 Difference]: Finished difference Result 511 states and 1385 transitions. [2025-04-13 22:26:11,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 22:26:11,087 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6666666666666667) 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 31 [2025-04-13 22:26:11,087 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:11,089 INFO L225 Difference]: With dead ends: 511 [2025-04-13 22:26:11,089 INFO L226 Difference]: Without dead ends: 503 [2025-04-13 22:26:11,089 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 22:26:11,089 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:11,089 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:26:11,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-04-13 22:26:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 398. [2025-04-13 22:26:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 397 states have (on average 2.795969773299748) internal successors, (1110), 397 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call 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:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1110 transitions. [2025-04-13 22:26:12,033 INFO L79 Accepts]: Start accepts. Automaton has 398 states and 1110 transitions. Word has length 31 [2025-04-13 22:26:12,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:12,033 INFO L485 AbstractCegarLoop]: Abstraction has 398 states and 1110 transitions. [2025-04-13 22:26:12,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6666666666666667) 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:26:12,033 INFO L278 IsEmpty]: Start isEmpty. Operand 398 states and 1110 transitions. [2025-04-13 22:26:12,033 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:12,033 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:12,033 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:12,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (262)] Ended with exit code 0 [2025-04-13 22:26:12,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable267,262 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:12,234 INFO L403 AbstractCegarLoop]: === Iteration 269 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:12,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:12,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1627242028, now seen corresponding path program 260 times [2025-04-13 22:26:12,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:12,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736961744] [2025-04-13 22:26:12,234 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:26:12,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:12,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:26:12,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:12,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:26:12,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:26:12,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:12,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736961744] [2025-04-13 22:26:12,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736961744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:12,817 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313841279] [2025-04-13 22:26:12,817 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:26:12,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:12,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:12,818 INFO L229 MonitoredProcess]: Starting monitored process 263 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:12,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (263)] Waiting until timeout for monitored process [2025-04-13 22:26:13,420 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:26:13,450 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:13,450 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:26:13,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:13,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:26:13,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:26:13,676 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:13,809 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:26:13,810 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 73 treesize of output 94 [2025-04-13 22:26:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:13,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313841279] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:13,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:13,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 33 [2025-04-13 22:26:13,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153838234] [2025-04-13 22:26:13,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:13,894 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:26:13,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:13,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:26:13,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:26:13,894 INFO L87 Difference]: Start difference. First operand 398 states and 1110 transitions. Second operand has 33 states, 33 states have (on average 1.7878787878787878) 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:26:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:16,350 INFO L93 Difference]: Finished difference Result 433 states and 1189 transitions. [2025-04-13 22:26:16,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 22:26:16,350 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7878787878787878) 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 31 [2025-04-13 22:26:16,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:16,352 INFO L225 Difference]: With dead ends: 433 [2025-04-13 22:26:16,352 INFO L226 Difference]: Without dead ends: 418 [2025-04-13 22:26:16,352 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=2667, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 22:26:16,352 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 953 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:16,352 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 953 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:26:16,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-04-13 22:26:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 402. [2025-04-13 22:26:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 401 states have (on average 2.7930174563591024) internal successors, (1120), 401 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call 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:17,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 1120 transitions. [2025-04-13 22:26:17,305 INFO L79 Accepts]: Start accepts. Automaton has 402 states and 1120 transitions. Word has length 31 [2025-04-13 22:26:17,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:17,305 INFO L485 AbstractCegarLoop]: Abstraction has 402 states and 1120 transitions. [2025-04-13 22:26:17,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7878787878787878) 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:26:17,306 INFO L278 IsEmpty]: Start isEmpty. Operand 402 states and 1120 transitions. [2025-04-13 22:26:17,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:17,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:17,306 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:17,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (263)] Ended with exit code 0 [2025-04-13 22:26:17,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 263 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable268 [2025-04-13 22:26:17,506 INFO L403 AbstractCegarLoop]: === Iteration 270 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:17,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:17,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1034122174, now seen corresponding path program 261 times [2025-04-13 22:26:17,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:17,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274217973] [2025-04-13 22:26:17,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:26:17,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:17,522 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:17,542 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 22:26:17,542 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:26:17,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:17,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:17,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274217973] [2025-04-13 22:26:17,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274217973] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:17,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472603238] [2025-04-13 22:26:17,959 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:26:17,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:17,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:17,961 INFO L229 MonitoredProcess]: Starting monitored process 264 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:17,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (264)] Waiting until timeout for monitored process [2025-04-13 22:26:18,560 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:18,593 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 22:26:18,593 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:26:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:18,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:26:18,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:18,829 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:18,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:18,970 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:26:18,970 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 67 treesize of output 71 [2025-04-13 22:26:19,031 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:19,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472603238] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:19,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:19,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 22:26:19,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839101554] [2025-04-13 22:26:19,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:19,032 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:26:19,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:19,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:26:19,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=880, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:26:19,032 INFO L87 Difference]: Start difference. First operand 402 states and 1120 transitions. Second operand has 32 states, 32 states have (on average 1.65625) 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:26:21,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:21,754 INFO L93 Difference]: Finished difference Result 488 states and 1319 transitions. [2025-04-13 22:26:21,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 22:26:21,755 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.65625) 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 31 [2025-04-13 22:26:21,755 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:21,756 INFO L225 Difference]: With dead ends: 488 [2025-04-13 22:26:21,756 INFO L226 Difference]: Without dead ends: 475 [2025-04-13 22:26:21,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 22:26:21,757 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:21,757 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:26:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-04-13 22:26:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 404. [2025-04-13 22:26:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.791563275434243) internal successors, (1125), 403 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call 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:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1125 transitions. [2025-04-13 22:26:22,714 INFO L79 Accepts]: Start accepts. Automaton has 404 states and 1125 transitions. Word has length 31 [2025-04-13 22:26:22,714 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:22,714 INFO L485 AbstractCegarLoop]: Abstraction has 404 states and 1125 transitions. [2025-04-13 22:26:22,714 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.65625) 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:26:22,715 INFO L278 IsEmpty]: Start isEmpty. Operand 404 states and 1125 transitions. [2025-04-13 22:26:22,715 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:22,715 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:22,715 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:22,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (264)] Ended with exit code 0 [2025-04-13 22:26:22,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 264 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable269 [2025-04-13 22:26:22,915 INFO L403 AbstractCegarLoop]: === Iteration 271 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:22,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:22,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1722963285, now seen corresponding path program 262 times [2025-04-13 22:26:22,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:22,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576845613] [2025-04-13 22:26:22,916 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:26:22,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:22,930 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:26:22,946 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:22,946 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:26:22,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:23,953 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:26:23,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:23,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576845613] [2025-04-13 22:26:23,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576845613] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:23,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818175037] [2025-04-13 22:26:23,953 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:26:23,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:23,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:23,955 INFO L229 MonitoredProcess]: Starting monitored process 265 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:23,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (265)] Waiting until timeout for monitored process [2025-04-13 22:26:24,547 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:26:24,574 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:24,574 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:26:24,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:24,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:26:24,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:24,729 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 22:26:24,730 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 33 treesize of output 9 [2025-04-13 22:26:24,732 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:26:24,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:24,886 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:26:24,886 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:26:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:24,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818175037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:24,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:24,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 11, 11] total 40 [2025-04-13 22:26:24,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035318397] [2025-04-13 22:26:24,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:24,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:26:24,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:24,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:26:24,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1409, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:26:24,959 INFO L87 Difference]: Start difference. First operand 404 states and 1125 transitions. Second operand has 40 states, 40 states have (on average 1.525) internal successors, (61), 40 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:26:28,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:28,679 INFO L93 Difference]: Finished difference Result 523 states and 1414 transitions. [2025-04-13 22:26:28,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 22:26:28,680 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.525) internal successors, (61), 40 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 31 [2025-04-13 22:26:28,680 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:28,681 INFO L225 Difference]: With dead ends: 523 [2025-04-13 22:26:28,681 INFO L226 Difference]: Without dead ends: 515 [2025-04-13 22:26:28,681 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1654 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=633, Invalid=5373, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 22:26:28,682 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1419 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:28,682 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:26:28,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-04-13 22:26:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 404. [2025-04-13 22:26:29,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.791563275434243) internal successors, (1125), 403 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call 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:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1125 transitions. [2025-04-13 22:26:29,644 INFO L79 Accepts]: Start accepts. Automaton has 404 states and 1125 transitions. Word has length 31 [2025-04-13 22:26:29,644 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:29,644 INFO L485 AbstractCegarLoop]: Abstraction has 404 states and 1125 transitions. [2025-04-13 22:26:29,644 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.525) internal successors, (61), 40 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:26:29,644 INFO L278 IsEmpty]: Start isEmpty. Operand 404 states and 1125 transitions. [2025-04-13 22:26:29,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:29,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:29,645 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:29,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (265)] Ended with exit code 0 [2025-04-13 22:26:29,845 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable270,265 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:29,845 INFO L403 AbstractCegarLoop]: === Iteration 272 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:29,845 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:29,845 INFO L85 PathProgramCache]: Analyzing trace with hash 256972575, now seen corresponding path program 263 times [2025-04-13 22:26:29,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:29,845 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155816325] [2025-04-13 22:26:29,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:26:29,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:29,860 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:29,883 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:29,883 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:26:29,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:30,337 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:26:30,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:30,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155816325] [2025-04-13 22:26:30,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155816325] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:30,337 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624601074] [2025-04-13 22:26:30,337 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:26:30,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:30,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:30,339 INFO L229 MonitoredProcess]: Starting monitored process 266 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:30,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (266)] Waiting until timeout for monitored process [2025-04-13 22:26:30,943 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:31,018 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:31,018 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:26:31,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:31,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-04-13 22:26:31,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:31,272 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 22:26:31,273 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 25 treesize of output 9 [2025-04-13 22:26:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-13 22:26:31,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:31,434 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:26:31,434 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 36 treesize of output 52 [2025-04-13 22:26:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:31,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624601074] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:31,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:31,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 11] total 33 [2025-04-13 22:26:31,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620368830] [2025-04-13 22:26:31,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:31,463 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 22:26:31,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:31,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 22:26:31,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=943, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 22:26:31,464 INFO L87 Difference]: Start difference. First operand 404 states and 1125 transitions. Second operand has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 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:26:34,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:34,346 INFO L93 Difference]: Finished difference Result 515 states and 1395 transitions. [2025-04-13 22:26:34,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 22:26:34,346 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 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 31 [2025-04-13 22:26:34,346 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:34,347 INFO L225 Difference]: With dead ends: 515 [2025-04-13 22:26:34,348 INFO L226 Difference]: Without dead ends: 507 [2025-04-13 22:26:34,348 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:26:34,348 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:34,348 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 978 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:26:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2025-04-13 22:26:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 404. [2025-04-13 22:26:35,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 403 states have (on average 2.791563275434243) internal successors, (1125), 403 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call 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:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 1125 transitions. [2025-04-13 22:26:35,316 INFO L79 Accepts]: Start accepts. Automaton has 404 states and 1125 transitions. Word has length 31 [2025-04-13 22:26:35,316 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:35,316 INFO L485 AbstractCegarLoop]: Abstraction has 404 states and 1125 transitions. [2025-04-13 22:26:35,316 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 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:26:35,316 INFO L278 IsEmpty]: Start isEmpty. Operand 404 states and 1125 transitions. [2025-04-13 22:26:35,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:35,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:35,317 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:35,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (266)] Ended with exit code 0 [2025-04-13 22:26:35,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 266 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable271 [2025-04-13 22:26:35,517 INFO L403 AbstractCegarLoop]: === Iteration 273 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:35,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:35,517 INFO L85 PathProgramCache]: Analyzing trace with hash -90507032, now seen corresponding path program 264 times [2025-04-13 22:26:35,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:35,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913321434] [2025-04-13 22:26:35,517 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:35,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:35,532 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:35,551 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:35,551 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:26:35,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:26:36,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:36,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913321434] [2025-04-13 22:26:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913321434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:36,083 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137339132] [2025-04-13 22:26:36,083 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:26:36,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:36,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:36,085 INFO L229 MonitoredProcess]: Starting monitored process 267 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:36,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (267)] Waiting until timeout for monitored process [2025-04-13 22:26:36,691 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:36,726 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:36,726 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:26:36,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:36,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:26:36,728 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:36,964 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:36,964 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 65 treesize of output 41 [2025-04-13 22:26:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:26:36,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:37,145 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:26:37,145 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 73 treesize of output 94 [2025-04-13 22:26:37,254 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:37,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137339132] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:37,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:37,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 35 [2025-04-13 22:26:37,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083253990] [2025-04-13 22:26:37,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:37,255 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:26:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:37,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:26:37,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1043, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:26:37,255 INFO L87 Difference]: Start difference. First operand 404 states and 1125 transitions. Second operand has 35 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 35 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:26:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:40,169 INFO L93 Difference]: Finished difference Result 482 states and 1305 transitions. [2025-04-13 22:26:40,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 22:26:40,169 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 35 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 31 [2025-04-13 22:26:40,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:40,170 INFO L225 Difference]: With dead ends: 482 [2025-04-13 22:26:40,170 INFO L226 Difference]: Without dead ends: 471 [2025-04-13 22:26:40,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=412, Invalid=3128, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 22:26:40,171 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:40,171 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:26:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-04-13 22:26:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 408. [2025-04-13 22:26:41,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 2.8034398034398036) internal successors, (1141), 407 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call 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:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1141 transitions. [2025-04-13 22:26:41,151 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1141 transitions. Word has length 31 [2025-04-13 22:26:41,151 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:41,151 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1141 transitions. [2025-04-13 22:26:41,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 35 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:26:41,152 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1141 transitions. [2025-04-13 22:26:41,152 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:41,152 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:41,152 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:41,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (267)] Ended with exit code 0 [2025-04-13 22:26:41,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable272,267 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:41,353 INFO L403 AbstractCegarLoop]: === Iteration 274 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:41,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -676491134, now seen corresponding path program 265 times [2025-04-13 22:26:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:41,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904897372] [2025-04-13 22:26:41,353 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:26:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:41,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:26:41,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:41,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:26:41,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:41,994 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 22:26:41,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:41,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904897372] [2025-04-13 22:26:41,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904897372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:41,994 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035216680] [2025-04-13 22:26:41,994 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:26:41,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:41,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:41,996 INFO L229 MonitoredProcess]: Starting monitored process 268 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:41,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (268)] Waiting until timeout for monitored process [2025-04-13 22:26:42,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:26:42,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:42,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:26:42,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:42,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:26:42,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:42,815 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:42,986 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:26:42,986 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 67 treesize of output 71 [2025-04-13 22:26:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:43,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035216680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:43,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:43,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 34 [2025-04-13 22:26:43,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004657443] [2025-04-13 22:26:43,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:43,002 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 22:26:43,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:43,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 22:26:43,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1006, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 22:26:43,003 INFO L87 Difference]: Start difference. First operand 408 states and 1141 transitions. Second operand has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:45,748 INFO L93 Difference]: Finished difference Result 498 states and 1356 transitions. [2025-04-13 22:26:45,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 22:26:45,749 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-04-13 22:26:45,749 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:45,750 INFO L225 Difference]: With dead ends: 498 [2025-04-13 22:26:45,750 INFO L226 Difference]: Without dead ends: 487 [2025-04-13 22:26:45,750 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=1834, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:26:45,750 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:45,750 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 22:26:45,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-04-13 22:26:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 410. [2025-04-13 22:26:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 409 states have (on average 2.801955990220049) internal successors, (1146), 409 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call 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:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1146 transitions. [2025-04-13 22:26:46,735 INFO L79 Accepts]: Start accepts. Automaton has 410 states and 1146 transitions. Word has length 31 [2025-04-13 22:26:46,735 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:46,736 INFO L485 AbstractCegarLoop]: Abstraction has 410 states and 1146 transitions. [2025-04-13 22:26:46,736 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.588235294117647) internal successors, (54), 34 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call 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:46,736 INFO L278 IsEmpty]: Start isEmpty. Operand 410 states and 1146 transitions. [2025-04-13 22:26:46,736 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:46,736 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:46,736 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:46,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (268)] Ended with exit code 0 [2025-04-13 22:26:46,936 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable273,268 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:46,937 INFO L403 AbstractCegarLoop]: === Iteration 275 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:46,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -60030839, now seen corresponding path program 266 times [2025-04-13 22:26:46,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:46,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19814957] [2025-04-13 22:26:46,937 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:26:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:46,951 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:26:46,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:46,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:26:46,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:47,559 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:26:47,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:47,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19814957] [2025-04-13 22:26:47,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19814957] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:47,559 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720465667] [2025-04-13 22:26:47,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:26:47,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:47,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:47,562 INFO L229 MonitoredProcess]: Starting monitored process 269 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:47,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (269)] Waiting until timeout for monitored process [2025-04-13 22:26:48,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:26:48,225 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:48,225 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:26:48,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:48,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-13 22:26:48,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:48,453 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:26:48,454 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 65 treesize of output 41 [2025-04-13 22:26:48,492 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:26:48,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:48,664 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:26:48,664 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:26:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:48,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720465667] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:48,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:48,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 11] total 35 [2025-04-13 22:26:48,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516081515] [2025-04-13 22:26:48,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:48,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:26:48,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:48,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:26:48,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:26:48,783 INFO L87 Difference]: Start difference. First operand 410 states and 1146 transitions. Second operand has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 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:26:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:52,548 INFO L93 Difference]: Finished difference Result 535 states and 1457 transitions. [2025-04-13 22:26:52,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 22:26:52,548 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 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 31 [2025-04-13 22:26:52,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:52,550 INFO L225 Difference]: With dead ends: 535 [2025-04-13 22:26:52,550 INFO L226 Difference]: Without dead ends: 521 [2025-04-13 22:26:52,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=672, Invalid=4020, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 22:26:52,550 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:52,550 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:26:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-04-13 22:26:53,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 420. [2025-04-13 22:26:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.799522673031026) internal successors, (1173), 419 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call 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:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1173 transitions. [2025-04-13 22:26:53,562 INFO L79 Accepts]: Start accepts. Automaton has 420 states and 1173 transitions. Word has length 31 [2025-04-13 22:26:53,562 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:53,562 INFO L485 AbstractCegarLoop]: Abstraction has 420 states and 1173 transitions. [2025-04-13 22:26:53,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 35 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:26:53,562 INFO L278 IsEmpty]: Start isEmpty. Operand 420 states and 1173 transitions. [2025-04-13 22:26:53,562 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:53,562 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:53,562 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:53,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (269)] Ended with exit code 0 [2025-04-13 22:26:53,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 269 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable274 [2025-04-13 22:26:53,763 INFO L403 AbstractCegarLoop]: === Iteration 276 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:53,763 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 268270849, now seen corresponding path program 267 times [2025-04-13 22:26:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:53,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372642836] [2025-04-13 22:26:53,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:26:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:53,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:53,797 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 22:26:53,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:26:53,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:26:54,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372642836] [2025-04-13 22:26:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372642836] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:26:54,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192588172] [2025-04-13 22:26:54,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:26:54,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:26:54,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:26:54,170 INFO L229 MonitoredProcess]: Starting monitored process 270 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:54,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (270)] Waiting until timeout for monitored process [2025-04-13 22:26:54,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:26:54,817 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 29 of 31 statements. [2025-04-13 22:26:54,817 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 22:26:54,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:26:54,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 22:26:54,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:26:55,057 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:26:55,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:26:55,208 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:26:55,208 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 36 treesize of output 52 [2025-04-13 22:26:55,264 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:26:55,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192588172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:26:55,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:26:55,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 22:26:55,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301190723] [2025-04-13 22:26:55,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:26:55,265 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:26:55,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:26:55,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:26:55,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:26:55,265 INFO L87 Difference]: Start difference. First operand 420 states and 1173 transitions. Second operand has 32 states, 32 states have (on average 1.71875) internal successors, (55), 32 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:26:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:26:58,181 INFO L93 Difference]: Finished difference Result 525 states and 1430 transitions. [2025-04-13 22:26:58,181 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:26:58,181 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 32 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 31 [2025-04-13 22:26:58,181 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:26:58,183 INFO L225 Difference]: With dead ends: 525 [2025-04-13 22:26:58,183 INFO L226 Difference]: Without dead ends: 517 [2025-04-13 22:26:58,183 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=1442, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:26:58,183 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1067 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:26:58,183 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 1078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1067 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:26:58,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-04-13 22:26:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 420. [2025-04-13 22:26:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 2.799522673031026) internal successors, (1173), 419 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call 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:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 1173 transitions. [2025-04-13 22:26:59,216 INFO L79 Accepts]: Start accepts. Automaton has 420 states and 1173 transitions. Word has length 31 [2025-04-13 22:26:59,217 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:26:59,217 INFO L485 AbstractCegarLoop]: Abstraction has 420 states and 1173 transitions. [2025-04-13 22:26:59,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 32 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:26:59,217 INFO L278 IsEmpty]: Start isEmpty. Operand 420 states and 1173 transitions. [2025-04-13 22:26:59,217 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:26:59,217 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:26:59,217 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:26:59,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (270)] Ended with exit code 0 [2025-04-13 22:26:59,417 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 270 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable275 [2025-04-13 22:26:59,418 INFO L403 AbstractCegarLoop]: === Iteration 277 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:26:59,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:26:59,418 INFO L85 PathProgramCache]: Analyzing trace with hash -145918292, now seen corresponding path program 268 times [2025-04-13 22:26:59,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:26:59,418 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064272358] [2025-04-13 22:26:59,418 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:26:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:26:59,433 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:26:59,446 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:26:59,446 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:26:59,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:00,045 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:27:00,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:00,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064272358] [2025-04-13 22:27:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064272358] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:00,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059828271] [2025-04-13 22:27:00,045 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:27:00,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:00,047 INFO L229 MonitoredProcess]: Starting monitored process 271 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:27:00,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (271)] Waiting until timeout for monitored process [2025-04-13 22:27:00,659 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:27:00,686 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:00,686 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:27:00,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:00,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 22:27:00,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:00,839 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:00,839 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 58 treesize of output 34 [2025-04-13 22:27:00,871 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:27:00,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:01,023 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:27:01,023 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 73 treesize of output 94 [2025-04-13 22:27:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:27:01,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059828271] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:01,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:01,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 35 [2025-04-13 22:27:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616463530] [2025-04-13 22:27:01,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:01,102 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 22:27:01,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:01,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 22:27:01,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1061, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 22:27:01,103 INFO L87 Difference]: Start difference. First operand 420 states and 1173 transitions. Second operand has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 35 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:27:03,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:03,819 INFO L93 Difference]: Finished difference Result 485 states and 1328 transitions. [2025-04-13 22:27:03,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:27:03,819 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 35 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 31 [2025-04-13 22:27:03,819 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:03,820 INFO L225 Difference]: With dead ends: 485 [2025-04-13 22:27:03,820 INFO L226 Difference]: Without dead ends: 476 [2025-04-13 22:27:03,821 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 768 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2025-04-13 22:27:03,821 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:03,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:27:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2025-04-13 22:27:04,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 414. [2025-04-13 22:27:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 413 states have (on average 2.7893462469733654) internal successors, (1152), 413 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:04,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 1152 transitions. [2025-04-13 22:27:04,846 INFO L79 Accepts]: Start accepts. Automaton has 414 states and 1152 transitions. Word has length 31 [2025-04-13 22:27:04,846 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:04,846 INFO L485 AbstractCegarLoop]: Abstraction has 414 states and 1152 transitions. [2025-04-13 22:27:04,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 35 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:27:04,846 INFO L278 IsEmpty]: Start isEmpty. Operand 414 states and 1152 transitions. [2025-04-13 22:27:04,846 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:27:04,846 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:04,846 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:04,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (271)] Ended with exit code 0 [2025-04-13 22:27:05,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable276,271 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:05,047 INFO L403 AbstractCegarLoop]: === Iteration 278 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:05,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:05,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1900727102, now seen corresponding path program 269 times [2025-04-13 22:27:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:05,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010404960] [2025-04-13 22:27:05,047 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:27:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:05,062 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:27:05,091 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:05,091 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:27:05,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:27:05,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:05,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010404960] [2025-04-13 22:27:05,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010404960] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:05,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143463972] [2025-04-13 22:27:05,590 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:27:05,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:05,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:05,592 INFO L229 MonitoredProcess]: Starting monitored process 272 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:27:05,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (272)] Waiting until timeout for monitored process [2025-04-13 22:27:06,209 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:27:06,293 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:06,293 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 22:27:06,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:06,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-04-13 22:27:06,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:06,498 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:06,499 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 73 treesize of output 45 [2025-04-13 22:27:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:27:06,533 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:06,711 INFO L325 Elim1Store]: treesize reduction 24, result has 67.1 percent of original size [2025-04-13 22:27:06,711 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 67 treesize of output 71 [2025-04-13 22:27:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:27:06,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143463972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:06,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:06,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 11] total 32 [2025-04-13 22:27:06,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416411572] [2025-04-13 22:27:06,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:06,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 22:27:06,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:06,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 22:27:06,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2025-04-13 22:27:06,751 INFO L87 Difference]: Start difference. First operand 414 states and 1152 transitions. Second operand has 32 states, 32 states have (on average 1.71875) internal successors, (55), 32 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:27:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:09,808 INFO L93 Difference]: Finished difference Result 505 states and 1363 transitions. [2025-04-13 22:27:09,808 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 22:27:09,809 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 32 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 31 [2025-04-13 22:27:09,809 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:09,810 INFO L225 Difference]: With dead ends: 505 [2025-04-13 22:27:09,810 INFO L226 Difference]: Without dead ends: 496 [2025-04-13 22:27:09,810 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=224, Invalid=1756, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 22:27:09,810 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 130 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:09,810 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 0 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 22:27:09,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-04-13 22:27:10,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 418. [2025-04-13 22:27:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.800959232613909) internal successors, (1168), 417 states have internal predecessors, (1168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1168 transitions. [2025-04-13 22:27:10,826 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1168 transitions. Word has length 31 [2025-04-13 22:27:10,826 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:10,826 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1168 transitions. [2025-04-13 22:27:10,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.71875) internal successors, (55), 32 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:27:10,826 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1168 transitions. [2025-04-13 22:27:10,827 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:27:10,827 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:10,827 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:10,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (272)] Ended with exit code 0 [2025-04-13 22:27:11,027 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 272 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable277 [2025-04-13 22:27:11,027 INFO L403 AbstractCegarLoop]: === Iteration 279 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:11,027 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1903368720, now seen corresponding path program 270 times [2025-04-13 22:27:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:11,028 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432998430] [2025-04-13 22:27:11,028 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:27:11,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:11,042 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:27:11,062 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:11,062 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:27:11,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 22:27:11,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:11,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432998430] [2025-04-13 22:27:11,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432998430] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:11,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600828622] [2025-04-13 22:27:11,582 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:27:11,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:11,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:11,584 INFO L229 MonitoredProcess]: Starting monitored process 273 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:27:11,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (273)] Waiting until timeout for monitored process [2025-04-13 22:27:12,199 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 31 statements into 4 equivalence classes. [2025-04-13 22:27:12,233 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:12,234 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 22:27:12,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:12,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 22:27:12,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:12,352 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:12,353 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 65 treesize of output 41 [2025-04-13 22:27:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:27:12,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:12,489 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 22:27:12,489 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 73 treesize of output 94 [2025-04-13 22:27:12,574 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:27:12,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600828622] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:12,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:12,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 11] total 31 [2025-04-13 22:27:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198022793] [2025-04-13 22:27:12,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:12,575 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 22:27:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:12,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 22:27:12,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2025-04-13 22:27:12,575 INFO L87 Difference]: Start difference. First operand 418 states and 1168 transitions. Second operand has 31 states, 31 states have (on average 1.6774193548387097) 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:27:15,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:15,321 INFO L93 Difference]: Finished difference Result 502 states and 1345 transitions. [2025-04-13 22:27:15,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 22:27:15,322 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6774193548387097) 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 31 [2025-04-13 22:27:15,322 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:15,323 INFO L225 Difference]: With dead ends: 502 [2025-04-13 22:27:15,323 INFO L226 Difference]: Without dead ends: 493 [2025-04-13 22:27:15,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=2464, Unknown=0, NotChecked=0, Total=2756 [2025-04-13 22:27:15,324 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:15,324 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 22:27:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2025-04-13 22:27:16,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 416. [2025-04-13 22:27:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.8072289156626504) internal successors, (1165), 415 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:16,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1165 transitions. [2025-04-13 22:27:16,365 INFO L79 Accepts]: Start accepts. Automaton has 416 states and 1165 transitions. Word has length 31 [2025-04-13 22:27:16,365 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:16,365 INFO L485 AbstractCegarLoop]: Abstraction has 416 states and 1165 transitions. [2025-04-13 22:27:16,365 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6774193548387097) 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:27:16,365 INFO L278 IsEmpty]: Start isEmpty. Operand 416 states and 1165 transitions. [2025-04-13 22:27:16,366 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:27:16,366 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:16,366 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:16,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (273)] Ended with exit code 0 [2025-04-13 22:27:16,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 273 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable278 [2025-04-13 22:27:16,566 INFO L403 AbstractCegarLoop]: === Iteration 280 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:16,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:16,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1931203295, now seen corresponding path program 271 times [2025-04-13 22:27:16,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:16,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861453737] [2025-04-13 22:27:16,566 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:27:16,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:16,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:27:16,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:16,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:27:16,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:17,168 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:27:17,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:17,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861453737] [2025-04-13 22:27:17,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861453737] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:17,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796778540] [2025-04-13 22:27:17,168 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:27:17,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:17,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:17,170 INFO L229 MonitoredProcess]: Starting monitored process 274 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:27:17,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (274)] Waiting until timeout for monitored process [2025-04-13 22:27:17,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 22:27:17,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:17,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:27:17,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:17,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 22:27:17,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:17,995 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 22:27:17,996 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 58 treesize of output 34 [2025-04-13 22:27:18,078 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:27:18,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:18,400 INFO L325 Elim1Store]: treesize reduction 28, result has 61.6 percent of original size [2025-04-13 22:27:18,400 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 36 treesize of output 52 [2025-04-13 22:27:18,408 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:27:18,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796778540] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:18,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:18,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 37 [2025-04-13 22:27:18,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297772629] [2025-04-13 22:27:18,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:18,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 22:27:18,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:18,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 22:27:18,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1206, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 22:27:18,409 INFO L87 Difference]: Start difference. First operand 416 states and 1165 transitions. Second operand has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 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:27:23,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:27:23,639 INFO L93 Difference]: Finished difference Result 604 states and 1557 transitions. [2025-04-13 22:27:23,640 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 22:27:23,640 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 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 31 [2025-04-13 22:27:23,640 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:27:23,641 INFO L225 Difference]: With dead ends: 604 [2025-04-13 22:27:23,641 INFO L226 Difference]: Without dead ends: 590 [2025-04-13 22:27:23,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=729, Invalid=4971, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 22:27:23,642 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 313 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:23,642 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 0 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 22:27:23,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2025-04-13 22:27:24,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 418. [2025-04-13 22:27:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.8105515587529974) internal successors, (1172), 417 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:27:24,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1172 transitions. [2025-04-13 22:27:24,676 INFO L79 Accepts]: Start accepts. Automaton has 418 states and 1172 transitions. Word has length 31 [2025-04-13 22:27:24,676 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:27:24,676 INFO L485 AbstractCegarLoop]: Abstraction has 418 states and 1172 transitions. [2025-04-13 22:27:24,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 37 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:27:24,677 INFO L278 IsEmpty]: Start isEmpty. Operand 418 states and 1172 transitions. [2025-04-13 22:27:24,677 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 22:27:24,677 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:27:24,677 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:27:24,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (274)] Ended with exit code 0 [2025-04-13 22:27:24,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 274 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable279 [2025-04-13 22:27:24,877 INFO L403 AbstractCegarLoop]: === Iteration 281 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 22:27:24,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:27:24,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1387010286, now seen corresponding path program 272 times [2025-04-13 22:27:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:27:24,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886661693] [2025-04-13 22:27:24,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:27:24,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:27:24,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:27:24,917 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:24,917 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:27:24,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:25,702 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 22:27:25,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:27:25,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886661693] [2025-04-13 22:27:25,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886661693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:27:25,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240376470] [2025-04-13 22:27:25,702 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:27:25,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:27:25,704 INFO L229 MonitoredProcess]: Starting monitored process 275 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:27:25,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (275)] Waiting until timeout for monitored process [2025-04-13 22:27:26,332 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 22:27:26,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 22:27:26,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:27:26,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:27:26,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 22:27:26,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:27:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 22:27:26,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:27:26,699 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 22:27:26,699 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 71 treesize of output 88 [2025-04-13 22:27:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 22:27:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240376470] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:27:26,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:27:26,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 11] total 40 [2025-04-13 22:27:26,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845618197] [2025-04-13 22:27:26,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:27:26,841 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 22:27:26,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:27:26,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 22:27:26,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1408, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 22:27:26,841 INFO L87 Difference]: Start difference. First operand 418 states and 1172 transitions. Second operand has 40 states, 40 states have (on average 1.725) internal successors, (69), 40 states have internal predecessors, (69), 0 states have call successors, (0), 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:27:27,195 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:27:27,201 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:27:27,202 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=236, Invalid=2020, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 22:27:27,202 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:27:27,202 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:27:27,203 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 22:27:27,209 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (275)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 22:27:27,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (275)] Ended with exit code 0 [2025-04-13 22:27:27,403 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable280,275 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:27:27,404 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (418states) and FLOYD_HOARE automaton (currently 11 states, 40 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. [2025-04-13 22:27:27,405 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 22:27:27,405 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 22:27:27,407 INFO L422 BasicCegarLoop]: Path program histogram: [272, 5, 3, 1] [2025-04-13 22:27:27,409 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 22:27:27,409 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 22:27:27,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 10:27:27 BasicIcfg [2025-04-13 22:27:27,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 22:27:27,410 INFO L158 Benchmark]: Toolchain (without parser) took 868123.58ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 98.6MB in the beginning and 471.9MB in the end (delta: -373.3MB). Peak memory consumption was 429.7MB. Max. memory is 8.0GB. [2025-04-13 22:27:27,411 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:27:27,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.18ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 83.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 22:27:27,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.87ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 22:27:27,411 INFO L158 Benchmark]: Boogie Preprocessor took 43.25ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 22:27:27,411 INFO L158 Benchmark]: IcfgBuilder took 645.26ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 78.1MB in the end (delta: 740.1kB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2025-04-13 22:27:27,411 INFO L158 Benchmark]: TraceAbstraction took 867138.28ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 78.1MB in the beginning and 471.9MB in the end (delta: -393.8MB). Peak memory consumption was 410.0MB. Max. memory is 8.0GB. [2025-04-13 22:27:27,411 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.19ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.18ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 83.0MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.87ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 43.25ms. Allocated memory is still 142.6MB. Free memory was 80.9MB in the beginning and 78.8MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 645.26ms. Allocated memory is still 142.6MB. Free memory was 78.8MB in the beginning and 78.1MB in the end (delta: 740.1kB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. * TraceAbstraction took 867138.28ms. Allocated memory was 142.6MB in the beginning and 947.9MB in the end (delta: 805.3MB). Free memory was 78.1MB in the beginning and 471.9MB in the end (delta: -393.8MB). Peak memory consumption was 410.0MB. 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 (418states) and FLOYD_HOARE automaton (currently 11 states, 40 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (418states) and FLOYD_HOARE automaton (currently 11 states, 40 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (418states) and FLOYD_HOARE automaton (currently 11 states, 40 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 48 known predicates. - 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: 867.1s, OverallIterations: 281, TraceHistogramMax: 5, PathProgramHistogramMax: 272, EmptinessCheckTime: 0.1s, AutomataDifference: 379.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 27333 SdHoareTripleChecker+Valid, 90.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 27333 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 77.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6604 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 250654 IncrementalHoareTripleChecker+Invalid, 257258 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6604 mSolverCounterUnsat, 0 mSDtfsCounter, 250654 mSolverCounterSat, 0.6s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23563 GetRequests, 11870 SyntacticMatches, 9 SemanticMatches, 11683 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128486 ImplicationChecksByTransitivity, 160.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=420occurred in iteration=275, InterpolantAutomatonStates: 6047, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 90.6s AutomataMinimizationTime, 280 MinimizatonAttempts, 16726 StatesRemovedByMinimization, 274 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 3.6s SsaConstructionTime, 15.3s SatisfiabilityAnalysisTime, 231.7s InterpolantComputationTime, 15971 NumberOfCodeBlocks, 15597 NumberOfCodeBlocksAsserted, 1430 NumberOfCheckSat, 23049 ConstructedInterpolants, 16 QuantifiedInterpolants, 221911 SizeOfPredicates, 4404 NumberOfNonLiveVariables, 90575 ConjunctsInSsa, 9742 ConjunctsInUnsatCore, 829 InterpolantComputations, 7 PerfectInterpolantSequences, 22225/33019 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