/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 17:44:34,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 17:44:34,262 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 17:44:34,269 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 17:44:34,269 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 17:44:34,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 17:44:34,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 17:44:34,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 17:44:34,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 17:44:34,289 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 17:44:34,289 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 17:44:34,289 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 17:44:34,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 17:44:34,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 17:44:34,290 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 17:44:34,290 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 17:44:34,291 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 17:44:34,291 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:44:34,291 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:44:34,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:44:34,292 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 17:44:34,292 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 17:44:34,293 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA [2025-04-13 17:44:34,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 17:44:34,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 17:44:34,519 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 17:44:34,520 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 17:44:34,520 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 17:44:34,521 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2025-04-13 17:44:35,903 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871e0adf6/a2409ab1d7b54f6cbf25a4a78761bad5/FLAG22d27d2c2 [2025-04-13 17:44:36,131 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 17:44:36,132 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c [2025-04-13 17:44:36,139 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871e0adf6/a2409ab1d7b54f6cbf25a4a78761bad5/FLAG22d27d2c2 [2025-04-13 17:44:36,904 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/871e0adf6/a2409ab1d7b54f6cbf25a4a78761bad5 [2025-04-13 17:44:36,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 17:44:36,907 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 17:44:36,911 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 17:44:36,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 17:44:36,914 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 17:44:36,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:44:36" (1/1) ... [2025-04-13 17:44:36,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@511f1ee6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:36, skipping insertion in model container [2025-04-13 17:44:36,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:44:36" (1/1) ... [2025-04-13 17:44:36,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 17:44:37,104 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-04-13 17:44:37,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:44:37,126 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 17:44:37,155 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-chromosome-opt-symm.wvr.c[2592,2605] [2025-04-13 17:44:37,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 17:44:37,173 INFO L204 MainTranslator]: Completed translation [2025-04-13 17:44:37,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37 WrapperNode [2025-04-13 17:44:37,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 17:44:37,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 17:44:37,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 17:44:37,175 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 17:44:37,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,184 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,200 INFO L138 Inliner]: procedures = 23, calls = 25, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 157 [2025-04-13 17:44:37,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 17:44:37,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 17:44:37,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 17:44:37,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 17:44:37,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,240 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-04-13 17:44:37,240 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,240 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,250 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,251 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,253 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,254 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 17:44:37,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 17:44:37,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 17:44:37,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 17:44:37,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (1/1) ... [2025-04-13 17:44:37,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 17:44:37,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:37,289 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 17:44:37,295 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 17:44:37,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 17:44:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 17:44:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 17:44:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 17:44:37,313 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 17:44:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 17:44:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 17:44:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 17:44:37,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 17:44:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 17:44:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 17:44:37,314 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 17:44:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 17:44:37,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 17:44:37,315 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 17:44:37,393 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 17:44:37,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 17:44:37,630 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 17:44:37,630 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 17:44:37,630 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 17:44:37,820 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 17:44:37,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:44:37 BoogieIcfgContainer [2025-04-13 17:44:37,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 17:44:37,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 17:44:37,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 17:44:37,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 17:44:37,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:44:36" (1/3) ... [2025-04-13 17:44:37,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532c68ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:44:37, skipping insertion in model container [2025-04-13 17:44:37,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:44:37" (2/3) ... [2025-04-13 17:44:37,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@532c68ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:44:37, skipping insertion in model container [2025-04-13 17:44:37,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:44:37" (3/3) ... [2025-04-13 17:44:37,829 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-04-13 17:44:37,840 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 17:44:37,841 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 18 locations, 19 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 17:44:37,841 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 17:44:37,887 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 17:44:37,918 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 24 places, 21 transitions, 56 flow [2025-04-13 17:44:37,927 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 17:44:37,949 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 17:44:37,956 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;@27e7b09f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 17:44:37,957 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 17:44:37,958 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 17:44:37,961 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-13 17:44:37,961 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:37,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:37,962 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 17:44:37,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:37,984 INFO L85 PathProgramCache]: Analyzing trace with hash -749331194, now seen corresponding path program 1 times [2025-04-13 17:44:37,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:37,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655873734] [2025-04-13 17:44:37,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:44:37,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 17:44:38,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 17:44:38,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:38,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:44:38,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:38,264 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655873734] [2025-04-13 17:44:38,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655873734] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:38,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:38,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 17:44:38,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241482741] [2025-04-13 17:44:38,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:38,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 17:44:38,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:38,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 17:44:38,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 17:44:38,287 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 17:44:38,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:38,348 INFO L93 Difference]: Finished difference Result 66 states and 143 transitions. [2025-04-13 17:44:38,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 17:44:38,349 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 17:44:38,349 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:38,354 INFO L225 Difference]: With dead ends: 66 [2025-04-13 17:44:38,354 INFO L226 Difference]: Without dead ends: 35 [2025-04-13 17:44:38,356 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 17:44:38,357 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 17:44:38,357 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 17:44:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-04-13 17:44:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-04-13 17:44:38,373 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 17:44:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 73 transitions. [2025-04-13 17:44:38,376 INFO L79 Accepts]: Start accepts. Automaton has 35 states and 73 transitions. Word has length 14 [2025-04-13 17:44:38,376 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:38,376 INFO L485 AbstractCegarLoop]: Abstraction has 35 states and 73 transitions. [2025-04-13 17:44:38,378 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 17:44:38,378 INFO L278 IsEmpty]: Start isEmpty. Operand 35 states and 73 transitions. [2025-04-13 17:44:38,378 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-04-13 17:44:38,378 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:38,378 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:38,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 17:44:38,379 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 17:44:38,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:38,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1306273871, now seen corresponding path program 1 times [2025-04-13 17:44:38,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:38,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244581050] [2025-04-13 17:44:38,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:44:38,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:38,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:44:38,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:44:38,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:38,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:38,542 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 17:44:38,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:38,542 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244581050] [2025-04-13 17:44:38,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244581050] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:38,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922533955] [2025-04-13 17:44:38,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:44:38,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:38,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:38,545 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 17:44:38,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 17:44:38,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-13 17:44:38,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-13 17:44:38,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:38,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:38,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 17:44:38,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:38,677 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 17:44:38,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:38,705 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 17:44:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922533955] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:38,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:38,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2025-04-13 17:44:38,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350508010] [2025-04-13 17:44:38,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:38,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:44:38,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:38,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:44:38,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:44:38,707 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 17:44:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:38,802 INFO L93 Difference]: Finished difference Result 73 states and 154 transitions. [2025-04-13 17:44:38,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 17:44:38,802 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 17:44:38,803 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:38,803 INFO L225 Difference]: With dead ends: 73 [2025-04-13 17:44:38,803 INFO L226 Difference]: Without dead ends: 41 [2025-04-13 17:44:38,804 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 17:44:38,804 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 17:44:38,804 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 17:44:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-04-13 17:44:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-04-13 17:44:38,810 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 17:44:38,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 79 transitions. [2025-04-13 17:44:38,810 INFO L79 Accepts]: Start accepts. Automaton has 41 states and 79 transitions. Word has length 16 [2025-04-13 17:44:38,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:38,811 INFO L485 AbstractCegarLoop]: Abstraction has 41 states and 79 transitions. [2025-04-13 17:44:38,811 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 17:44:38,811 INFO L278 IsEmpty]: Start isEmpty. Operand 41 states and 79 transitions. [2025-04-13 17:44:38,811 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:44:38,811 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:38,811 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:38,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 17:44:39,012 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 17:44:39,012 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 17:44:39,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash 884358086, now seen corresponding path program 2 times [2025-04-13 17:44:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:39,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186576245] [2025-04-13 17:44:39,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:39,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-04-13 17:44:39,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 22 statements. [2025-04-13 17:44:39,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:44:39,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:39,883 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 17:44:39,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:39,883 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186576245] [2025-04-13 17:44:39,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186576245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:39,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:39,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:44:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826511691] [2025-04-13 17:44:39,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:39,884 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:44:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:39,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:44:39,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:44:39,885 INFO L87 Difference]: Start difference. First operand 41 states and 79 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:40,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:40,233 INFO L93 Difference]: Finished difference Result 74 states and 151 transitions. [2025-04-13 17:44:40,234 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:44:40,234 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 17:44:40,234 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:40,234 INFO L225 Difference]: With dead ends: 74 [2025-04-13 17:44:40,235 INFO L226 Difference]: Without dead ends: 69 [2025-04-13 17:44:40,235 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-04-13 17:44:40,235 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:40,235 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:40,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-04-13 17:44:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 53. [2025-04-13 17:44:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 2.0) internal successors, (104), 52 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 104 transitions. [2025-04-13 17:44:40,243 INFO L79 Accepts]: Start accepts. Automaton has 53 states and 104 transitions. Word has length 22 [2025-04-13 17:44:40,243 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:40,243 INFO L485 AbstractCegarLoop]: Abstraction has 53 states and 104 transitions. [2025-04-13 17:44:40,243 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:40,243 INFO L278 IsEmpty]: Start isEmpty. Operand 53 states and 104 transitions. [2025-04-13 17:44:40,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:44:40,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:40,243 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:40,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 17:44:40,244 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 17:44:40,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash 29093696, now seen corresponding path program 3 times [2025-04-13 17:44:40,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:40,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466059907] [2025-04-13 17:44:40,244 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:40,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 3 equivalence classes. [2025-04-13 17:44:40,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 22 statements. [2025-04-13 17:44:40,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 17:44:40,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:40,824 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 17:44:40,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:40,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466059907] [2025-04-13 17:44:40,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466059907] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:40,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:40,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:44:40,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931167369] [2025-04-13 17:44:40,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:40,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:44:40,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:40,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:44:40,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:44:40,826 INFO L87 Difference]: Start difference. First operand 53 states and 104 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:41,060 INFO L93 Difference]: Finished difference Result 89 states and 172 transitions. [2025-04-13 17:44:41,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:44:41,061 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 17:44:41,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:41,062 INFO L225 Difference]: With dead ends: 89 [2025-04-13 17:44:41,062 INFO L226 Difference]: Without dead ends: 74 [2025-04-13 17:44:41,062 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:44:41,062 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:41,063 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-04-13 17:44:41,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 55. [2025-04-13 17:44:41,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 2.0555555555555554) internal successors, (111), 54 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 111 transitions. [2025-04-13 17:44:41,072 INFO L79 Accepts]: Start accepts. Automaton has 55 states and 111 transitions. Word has length 22 [2025-04-13 17:44:41,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:41,073 INFO L485 AbstractCegarLoop]: Abstraction has 55 states and 111 transitions. [2025-04-13 17:44:41,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,073 INFO L278 IsEmpty]: Start isEmpty. Operand 55 states and 111 transitions. [2025-04-13 17:44:41,073 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:44:41,073 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:41,074 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:41,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 17:44:41,074 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 17:44:41,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash 31630736, now seen corresponding path program 4 times [2025-04-13 17:44:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:41,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655169144] [2025-04-13 17:44:41,074 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:44:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:41,085 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 22 statements into 2 equivalence classes. [2025-04-13 17:44:41,092 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 11 of 22 statements. [2025-04-13 17:44:41,092 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:44:41,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:41,299 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 17:44:41,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:41,299 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655169144] [2025-04-13 17:44:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655169144] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:41,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:41,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 17:44:41,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97916202] [2025-04-13 17:44:41,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:41,300 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 17:44:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:41,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 17:44:41,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 17:44:41,300 INFO L87 Difference]: Start difference. First operand 55 states and 111 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:41,501 INFO L93 Difference]: Finished difference Result 82 states and 171 transitions. [2025-04-13 17:44:41,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:44:41,502 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 17:44:41,502 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:41,503 INFO L225 Difference]: With dead ends: 82 [2025-04-13 17:44:41,503 INFO L226 Difference]: Without dead ends: 77 [2025-04-13 17:44:41,503 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:44:41,503 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:41,503 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-13 17:44:41,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2025-04-13 17:44:41,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 2.0357142857142856) internal successors, (114), 56 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 114 transitions. [2025-04-13 17:44:41,517 INFO L79 Accepts]: Start accepts. Automaton has 57 states and 114 transitions. Word has length 22 [2025-04-13 17:44:41,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:41,517 INFO L485 AbstractCegarLoop]: Abstraction has 57 states and 114 transitions. [2025-04-13 17:44:41,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,517 INFO L278 IsEmpty]: Start isEmpty. Operand 57 states and 114 transitions. [2025-04-13 17:44:41,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 17:44:41,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:41,518 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:41,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 17:44:41,518 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 17:44:41,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash 102440860, now seen corresponding path program 5 times [2025-04-13 17:44:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:41,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100109477] [2025-04-13 17:44:41,519 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:44:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:41,532 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 17:44:41,540 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:44:41,541 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:44:41,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:41,609 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 17:44:41,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:41,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100109477] [2025-04-13 17:44:41,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100109477] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:41,610 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272511170] [2025-04-13 17:44:41,610 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:44:41,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:41,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:41,612 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 17:44:41,613 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 17:44:41,670 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 22 statements into 3 equivalence classes. [2025-04-13 17:44:41,712 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 17:44:41,712 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-13 17:44:41,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:41,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 17:44:41,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:41,772 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 17:44:41,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:41,803 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 17:44:41,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272511170] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:41,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:41,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-04-13 17:44:41,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376669596] [2025-04-13 17:44:41,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:41,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:44:41,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:41,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:44:41,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:44:41,804 INFO L87 Difference]: Start difference. First operand 57 states and 114 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:41,859 INFO L93 Difference]: Finished difference Result 110 states and 225 transitions. [2025-04-13 17:44:41,860 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:44:41,860 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 17:44:41,860 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:41,860 INFO L225 Difference]: With dead ends: 110 [2025-04-13 17:44:41,860 INFO L226 Difference]: Without dead ends: 59 [2025-04-13 17:44:41,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:44:41,861 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:41,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 17:44:41,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-13 17:44:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-04-13 17:44:41,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 2.0) internal successors, (116), 58 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 116 transitions. [2025-04-13 17:44:41,868 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 116 transitions. Word has length 22 [2025-04-13 17:44:41,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:41,868 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 116 transitions. [2025-04-13 17:44:41,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:41,869 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 116 transitions. [2025-04-13 17:44:41,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:44:41,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:41,869 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:41,875 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 17:44:42,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-13 17:44:42,070 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 17:44:42,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:42,070 INFO L85 PathProgramCache]: Analyzing trace with hash -115602233, now seen corresponding path program 6 times [2025-04-13 17:44:42,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:42,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075465038] [2025-04-13 17:44:42,070 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:44:42,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:42,081 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 24 statements into 4 equivalence classes. [2025-04-13 17:44:42,090 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-13 17:44:42,091 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 17:44:42,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:42,468 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 17:44:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:42,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075465038] [2025-04-13 17:44:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075465038] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:42,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:42,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:44:42,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802573110] [2025-04-13 17:44:42,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:42,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:44:42,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:42,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:44:42,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:44:42,470 INFO L87 Difference]: Start difference. First operand 59 states and 116 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:42,696 INFO L93 Difference]: Finished difference Result 99 states and 194 transitions. [2025-04-13 17:44:42,696 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:44:42,697 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:44:42,697 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:42,697 INFO L225 Difference]: With dead ends: 99 [2025-04-13 17:44:42,697 INFO L226 Difference]: Without dead ends: 84 [2025-04-13 17:44:42,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:44:42,699 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:42,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:42,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-04-13 17:44:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2025-04-13 17:44:42,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.096774193548387) internal successors, (130), 62 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 130 transitions. [2025-04-13 17:44:42,711 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 130 transitions. Word has length 24 [2025-04-13 17:44:42,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:42,711 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 130 transitions. [2025-04-13 17:44:42,712 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:42,712 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 130 transitions. [2025-04-13 17:44:42,712 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:44:42,712 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:42,712 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:42,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 17:44:42,715 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 17:44:42,716 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:42,716 INFO L85 PathProgramCache]: Analyzing trace with hash -113065193, now seen corresponding path program 7 times [2025-04-13 17:44:42,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:42,716 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922481250] [2025-04-13 17:44:42,716 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:44:42,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:42,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 17:44:42,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 17:44:42,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:42,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:43,257 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 17:44:43,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:43,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922481250] [2025-04-13 17:44:43,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922481250] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:43,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:43,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:44:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968531135] [2025-04-13 17:44:43,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:43,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:44:43,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:43,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:44:43,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:44:43,258 INFO L87 Difference]: Start difference. First operand 63 states and 130 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:43,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:43,540 INFO L93 Difference]: Finished difference Result 96 states and 194 transitions. [2025-04-13 17:44:43,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:44:43,540 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:44:43,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:43,541 INFO L225 Difference]: With dead ends: 96 [2025-04-13 17:44:43,541 INFO L226 Difference]: Without dead ends: 91 [2025-04-13 17:44:43,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:44:43,542 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:43,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:44:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-13 17:44:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 61. [2025-04-13 17:44:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 2.05) internal successors, (123), 60 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 123 transitions. [2025-04-13 17:44:43,550 INFO L79 Accepts]: Start accepts. Automaton has 61 states and 123 transitions. Word has length 24 [2025-04-13 17:44:43,550 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:43,550 INFO L485 AbstractCegarLoop]: Abstraction has 61 states and 123 transitions. [2025-04-13 17:44:43,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:43,551 INFO L278 IsEmpty]: Start isEmpty. Operand 61 states and 123 transitions. [2025-04-13 17:44:43,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-04-13 17:44:43,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:43,551 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:44:43,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 17:44:43,551 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 17:44:43,552 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:43,552 INFO L85 PathProgramCache]: Analyzing trace with hash 25462957, now seen corresponding path program 8 times [2025-04-13 17:44:43,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:43,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196828816] [2025-04-13 17:44:43,552 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:43,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-13 17:44:43,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 24 statements. [2025-04-13 17:44:43,573 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 17:44:43,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:43,938 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 17:44:43,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:43,938 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196828816] [2025-04-13 17:44:43,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196828816] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:43,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:43,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:44:43,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449351212] [2025-04-13 17:44:43,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:43,939 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:44:43,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:43,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:44:43,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:44:43,940 INFO L87 Difference]: Start difference. First operand 61 states and 123 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:44,301 INFO L93 Difference]: Finished difference Result 87 states and 178 transitions. [2025-04-13 17:44:44,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:44:44,302 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-04-13 17:44:44,302 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:44,303 INFO L225 Difference]: With dead ends: 87 [2025-04-13 17:44:44,303 INFO L226 Difference]: Without dead ends: 82 [2025-04-13 17:44:44,303 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:44:44,304 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:44,304 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:44:44,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-13 17:44:44,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 63. [2025-04-13 17:44:44,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 2.032258064516129) internal successors, (126), 62 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 126 transitions. [2025-04-13 17:44:44,317 INFO L79 Accepts]: Start accepts. Automaton has 63 states and 126 transitions. Word has length 24 [2025-04-13 17:44:44,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:44,318 INFO L485 AbstractCegarLoop]: Abstraction has 63 states and 126 transitions. [2025-04-13 17:44:44,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:44,318 INFO L278 IsEmpty]: Start isEmpty. Operand 63 states and 126 transitions. [2025-04-13 17:44:44,319 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:44,319 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:44,319 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 17:44:44,319 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 17:44:44,320 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 17:44:44,320 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:44,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1642463970, now seen corresponding path program 1 times [2025-04-13 17:44:44,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:44,320 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296201711] [2025-04-13 17:44:44,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:44:44,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:44,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:44:44,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:44,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:44,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:44,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:44,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296201711] [2025-04-13 17:44:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296201711] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:44,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449167153] [2025-04-13 17:44:44,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:44:44,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:44,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:44,747 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 17:44:44,755 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 17:44:44,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:44:44,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:44,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:44,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:44,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:44:44,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:44,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:45,043 INFO L325 Elim1Store]: treesize reduction 11, result has 84.1 percent of original size [2025-04-13 17:44:45,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 37 treesize of output 70 [2025-04-13 17:44:45,082 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:45,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449167153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:45,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:45,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2025-04-13 17:44:45,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514172698] [2025-04-13 17:44:45,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:45,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 17:44:45,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:45,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 17:44:45,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:44:45,083 INFO L87 Difference]: Start difference. First operand 63 states and 126 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:45,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:45,223 INFO L93 Difference]: Finished difference Result 87 states and 178 transitions. [2025-04-13 17:44:45,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:44:45,224 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:45,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:45,224 INFO L225 Difference]: With dead ends: 87 [2025-04-13 17:44:45,224 INFO L226 Difference]: Without dead ends: 80 [2025-04-13 17:44:45,225 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:44:45,225 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:45,225 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:45,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-13 17:44:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 60. [2025-04-13 17:44:45,240 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 17:44:45,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 126 transitions. [2025-04-13 17:44:45,240 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 126 transitions. Word has length 25 [2025-04-13 17:44:45,240 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:45,241 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 126 transitions. [2025-04-13 17:44:45,241 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:45,241 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 126 transitions. [2025-04-13 17:44:45,243 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:45,243 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:45,243 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 17:44:45,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 17:44:45,447 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 17:44:45,447 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 17:44:45,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash -819106051, now seen corresponding path program 1 times [2025-04-13 17:44:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:45,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769309324] [2025-04-13 17:44:45,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:44:45,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 17:44:45,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:45,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:45,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:45,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:45,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769309324] [2025-04-13 17:44:45,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769309324] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:45,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:45,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:44:45,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439363613] [2025-04-13 17:44:45,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:45,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:44:45,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:45,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:44:45,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:44:45,798 INFO L87 Difference]: Start difference. First operand 60 states and 126 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:45,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:45,917 INFO L93 Difference]: Finished difference Result 88 states and 176 transitions. [2025-04-13 17:44:45,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 17:44:45,917 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:45,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:45,918 INFO L225 Difference]: With dead ends: 88 [2025-04-13 17:44:45,918 INFO L226 Difference]: Without dead ends: 72 [2025-04-13 17:44:45,918 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:44:45,919 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 35 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:45,919 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 0 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-04-13 17:44:45,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 60. [2025-04-13 17:44:45,928 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 17:44:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2025-04-13 17:44:45,929 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2025-04-13 17:44:45,929 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:45,929 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2025-04-13 17:44:45,929 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:45,929 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2025-04-13 17:44:45,929 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:45,929 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:45,931 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 17:44:45,931 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 17:44:45,931 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 17:44:45,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:45,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1598336938, now seen corresponding path program 2 times [2025-04-13 17:44:45,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:45,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507975375] [2025-04-13 17:44:45,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:45,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:45,941 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:45,975 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:45,975 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:44:45,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:46,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507975375] [2025-04-13 17:44:46,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507975375] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:46,288 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133242587] [2025-04-13 17:44:46,288 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:46,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:46,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:46,290 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 17:44:46,291 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 17:44:46,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:46,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:46,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:44:46,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:46,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:44:46,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:46,454 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:46,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:46,564 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:44:46,564 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 17:44:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:46,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133242587] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:46,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:46,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2025-04-13 17:44:46,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492646756] [2025-04-13 17:44:46,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:46,622 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:44:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:46,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:44:46,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:44:46,623 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:46,773 INFO L93 Difference]: Finished difference Result 95 states and 193 transitions. [2025-04-13 17:44:46,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:44:46,773 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:46,773 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:46,774 INFO L225 Difference]: With dead ends: 95 [2025-04-13 17:44:46,774 INFO L226 Difference]: Without dead ends: 88 [2025-04-13 17:44:46,774 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:44:46,774 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:46,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-13 17:44:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 62. [2025-04-13 17:44:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 61 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:46,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 129 transitions. [2025-04-13 17:44:46,783 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 129 transitions. Word has length 25 [2025-04-13 17:44:46,783 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:46,783 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 129 transitions. [2025-04-13 17:44:46,783 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:46,783 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 129 transitions. [2025-04-13 17:44:46,784 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:46,784 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:46,784 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 17:44:46,791 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 17:44:46,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:46,984 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 17:44:46,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:46,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1512449485, now seen corresponding path program 2 times [2025-04-13 17:44:46,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:46,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855412163] [2025-04-13 17:44:46,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:46,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:46,993 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:47,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:47,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:44:47,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:47,348 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:47,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:47,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855412163] [2025-04-13 17:44:47,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855412163] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:47,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455231083] [2025-04-13 17:44:47,348 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:47,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:47,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:47,350 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 17:44:47,351 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 17:44:47,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:47,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:47,443 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:44:47,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:47,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:44:47,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:47,505 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:47,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:47,606 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:44:47,606 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 17:44:47,663 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:47,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455231083] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:47,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:47,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2025-04-13 17:44:47,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033604903] [2025-04-13 17:44:47,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:47,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:44:47,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:47,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:44:47,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:44:47,665 INFO L87 Difference]: Start difference. First operand 62 states and 129 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:47,778 INFO L93 Difference]: Finished difference Result 88 states and 184 transitions. [2025-04-13 17:44:47,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:44:47,779 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:47,779 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:47,779 INFO L225 Difference]: With dead ends: 88 [2025-04-13 17:44:47,779 INFO L226 Difference]: Without dead ends: 80 [2025-04-13 17:44:47,780 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:44:47,780 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 32 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:47,780 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 0 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-04-13 17:44:47,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 64. [2025-04-13 17:44:47,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.1587301587301586) internal successors, (136), 63 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:47,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 136 transitions. [2025-04-13 17:44:47,790 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 136 transitions. Word has length 25 [2025-04-13 17:44:47,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:47,790 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 136 transitions. [2025-04-13 17:44:47,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:47,790 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 136 transitions. [2025-04-13 17:44:47,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:47,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:47,790 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 17:44:47,798 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 17:44:47,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 17:44:47,991 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 17:44:47,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1484977378, now seen corresponding path program 3 times [2025-04-13 17:44:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:47,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214397952] [2025-04-13 17:44:47,992 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:48,001 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 17:44:48,024 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-13 17:44:48,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:44:48,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:48,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:48,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:48,273 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214397952] [2025-04-13 17:44:48,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214397952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:48,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:48,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 17:44:48,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638183494] [2025-04-13 17:44:48,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:48,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 17:44:48,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:48,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 17:44:48,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 17:44:48,274 INFO L87 Difference]: Start difference. First operand 64 states and 136 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:48,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:48,386 INFO L93 Difference]: Finished difference Result 85 states and 174 transitions. [2025-04-13 17:44:48,386 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:44:48,386 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:48,386 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:48,387 INFO L225 Difference]: With dead ends: 85 [2025-04-13 17:44:48,387 INFO L226 Difference]: Without dead ends: 76 [2025-04-13 17:44:48,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 17:44:48,388 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:48,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-04-13 17:44:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2025-04-13 17:44:48,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2025-04-13 17:44:48,398 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 134 transitions. Word has length 25 [2025-04-13 17:44:48,398 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:48,398 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 134 transitions. [2025-04-13 17:44:48,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:48,399 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 134 transitions. [2025-04-13 17:44:48,399 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:48,399 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:48,399 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 17:44:48,399 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 17:44:48,399 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 17:44:48,399 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash 675425146, now seen corresponding path program 4 times [2025-04-13 17:44:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:48,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320096998] [2025-04-13 17:44:48,400 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:44:48,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:48,408 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:48,412 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-13 17:44:48,412 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:44:48,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:48,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:48,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320096998] [2025-04-13 17:44:48,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320096998] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:48,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959399061] [2025-04-13 17:44:48,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:44:48,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:48,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:48,503 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 17:44:48,507 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 17:44:48,574 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:48,581 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-13 17:44:48,581 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:44:48,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:48,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:44:48,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:48,627 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:48,627 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:48,757 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:44:48,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 17:44:48,793 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:48,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959399061] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:48,793 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:48,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-13 17:44:48,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950257820] [2025-04-13 17:44:48,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:48,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:44:48,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:48,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:44:48,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:44:48,794 INFO L87 Difference]: Start difference. First operand 64 states and 134 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:48,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:48,904 INFO L93 Difference]: Finished difference Result 85 states and 172 transitions. [2025-04-13 17:44:48,904 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:44:48,904 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:48,904 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:48,905 INFO L225 Difference]: With dead ends: 85 [2025-04-13 17:44:48,905 INFO L226 Difference]: Without dead ends: 78 [2025-04-13 17:44:48,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:44:48,905 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:48,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:48,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-04-13 17:44:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2025-04-13 17:44:48,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:48,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2025-04-13 17:44:48,917 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 134 transitions. Word has length 25 [2025-04-13 17:44:48,917 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:48,917 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 134 transitions. [2025-04-13 17:44:48,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:48,917 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 134 transitions. [2025-04-13 17:44:48,917 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:48,917 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:48,917 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 17:44:48,924 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 17:44:49,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-13 17:44:49,119 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 17:44:49,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash 761312599, now seen corresponding path program 3 times [2025-04-13 17:44:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:49,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453296328] [2025-04-13 17:44:49,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:49,132 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 17:44:49,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-13 17:44:49,157 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:44:49,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:49,401 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:49,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:49,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453296328] [2025-04-13 17:44:49,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453296328] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:49,402 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386846125] [2025-04-13 17:44:49,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:49,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:49,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:49,404 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 17:44:49,406 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 17:44:49,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 4 equivalence classes. [2025-04-13 17:44:49,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 25 statements. [2025-04-13 17:44:49,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:44:49,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:49,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:44:49,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:49,550 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:49,637 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:44:49,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 48 treesize of output 81 [2025-04-13 17:44:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:49,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386846125] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:49,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:49,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 5] total 11 [2025-04-13 17:44:49,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106792092] [2025-04-13 17:44:49,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:49,686 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 17:44:49,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:49,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 17:44:49,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 17:44:49,687 INFO L87 Difference]: Start difference. First operand 64 states and 134 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:49,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:49,779 INFO L93 Difference]: Finished difference Result 85 states and 172 transitions. [2025-04-13 17:44:49,779 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:44:49,780 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:49,780 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:49,780 INFO L225 Difference]: With dead ends: 85 [2025-04-13 17:44:49,780 INFO L226 Difference]: Without dead ends: 77 [2025-04-13 17:44:49,781 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 17:44:49,781 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 37 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:49,781 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 0 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-04-13 17:44:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 64. [2025-04-13 17:44:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.126984126984127) internal successors, (134), 63 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:49,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 134 transitions. [2025-04-13 17:44:49,789 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 134 transitions. Word has length 25 [2025-04-13 17:44:49,790 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:49,790 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 134 transitions. [2025-04-13 17:44:49,790 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:49,790 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 134 transitions. [2025-04-13 17:44:49,790 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:49,790 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:49,791 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 17:44:49,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 17:44:49,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:49,992 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 17:44:49,992 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash 788784706, now seen corresponding path program 5 times [2025-04-13 17:44:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:49,992 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614111228] [2025-04-13 17:44:49,992 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:44:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:50,007 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes. [2025-04-13 17:44:50,034 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:50,034 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:44:50,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 17:44:50,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:50,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614111228] [2025-04-13 17:44:50,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614111228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:50,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748481358] [2025-04-13 17:44:50,433 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:44:50,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:50,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:50,435 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 17:44:50,437 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 17:44:50,512 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 4 equivalence classes. [2025-04-13 17:44:50,567 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 17:44:50,567 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:44:50,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:50,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:44:50,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:50,649 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 17:44:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748481358] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:50,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 17:44:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-04-13 17:44:50,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019839399] [2025-04-13 17:44:50,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:50,650 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:44:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:50,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:44:50,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:44:50,650 INFO L87 Difference]: Start difference. First operand 64 states and 134 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 17:44:50,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:50,762 INFO L93 Difference]: Finished difference Result 82 states and 158 transitions. [2025-04-13 17:44:50,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 17:44:50,762 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 17:44:50,762 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:50,763 INFO L225 Difference]: With dead ends: 82 [2025-04-13 17:44:50,763 INFO L226 Difference]: Without dead ends: 73 [2025-04-13 17:44:50,763 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:44:50,764 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:50,764 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-04-13 17:44:50,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2025-04-13 17:44:50,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 2.081967213114754) internal successors, (127), 61 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 127 transitions. [2025-04-13 17:44:50,778 INFO L79 Accepts]: Start accepts. Automaton has 62 states and 127 transitions. Word has length 25 [2025-04-13 17:44:50,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:50,778 INFO L485 AbstractCegarLoop]: Abstraction has 62 states and 127 transitions. [2025-04-13 17:44:50,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 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 17:44:50,778 INFO L278 IsEmpty]: Start isEmpty. Operand 62 states and 127 transitions. [2025-04-13 17:44:50,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:50,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:50,778 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 17:44:50,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 17:44:50,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-13 17:44:50,979 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 17:44:50,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash -98156577, now seen corresponding path program 4 times [2025-04-13 17:44:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:50,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167295463] [2025-04-13 17:44:50,979 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:44:50,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:50,987 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:50,990 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-13 17:44:50,990 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:44:50,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:51,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:51,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167295463] [2025-04-13 17:44:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167295463] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:51,082 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046805052] [2025-04-13 17:44:51,082 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:44:51,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:51,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:51,084 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 17:44:51,086 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 17:44:51,157 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 17:44:51,164 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 12 of 25 statements. [2025-04-13 17:44:51,164 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:44:51,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:51,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 17:44:51,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:51,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:51,289 INFO L325 Elim1Store]: treesize reduction 11, result has 84.1 percent of original size [2025-04-13 17:44:51,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 70 [2025-04-13 17:44:51,330 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:51,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046805052] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:51,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:51,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-04-13 17:44:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298280298] [2025-04-13 17:44:51,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:51,331 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 17:44:51,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:51,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 17:44:51,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:44:51,331 INFO L87 Difference]: Start difference. First operand 62 states and 127 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:51,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:51,453 INFO L93 Difference]: Finished difference Result 83 states and 165 transitions. [2025-04-13 17:44:51,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 17:44:51,453 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:51,453 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:51,454 INFO L225 Difference]: With dead ends: 83 [2025-04-13 17:44:51,454 INFO L226 Difference]: Without dead ends: 75 [2025-04-13 17:44:51,454 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 17:44:51,454 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:51,455 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-04-13 17:44:51,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 60. [2025-04-13 17:44:51,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 59 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 124 transitions. [2025-04-13 17:44:51,463 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 124 transitions. Word has length 25 [2025-04-13 17:44:51,463 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:51,463 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 124 transitions. [2025-04-13 17:44:51,463 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:51,463 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 124 transitions. [2025-04-13 17:44:51,463 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 17:44:51,463 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:51,463 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 17:44:51,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-13 17:44:51,663 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-13 17:44:51,664 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 17:44:51,664 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:51,664 INFO L85 PathProgramCache]: Analyzing trace with hash 788190060, now seen corresponding path program 6 times [2025-04-13 17:44:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:51,664 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797520886] [2025-04-13 17:44:51,664 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:44:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:51,672 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 4 equivalence classes. [2025-04-13 17:44:51,687 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 21 of 25 statements. [2025-04-13 17:44:51,687 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:44:51,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:44:51,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:51,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797520886] [2025-04-13 17:44:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797520886] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 17:44:51,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 17:44:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 17:44:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692391881] [2025-04-13 17:44:51,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 17:44:51,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 17:44:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:51,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 17:44:51,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 17:44:51,950 INFO L87 Difference]: Start difference. First operand 60 states and 124 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:52,088 INFO L93 Difference]: Finished difference Result 71 states and 139 transitions. [2025-04-13 17:44:52,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 17:44:52,089 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 17:44:52,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:52,090 INFO L225 Difference]: With dead ends: 71 [2025-04-13 17:44:52,090 INFO L226 Difference]: Without dead ends: 60 [2025-04-13 17:44:52,090 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:44:52,091 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:52,091 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:44:52,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-04-13 17:44:52,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-04-13 17:44:52,100 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 17:44:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2025-04-13 17:44:52,101 INFO L79 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2025-04-13 17:44:52,101 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:52,101 INFO L485 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2025-04-13 17:44:52,101 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:52,101 INFO L278 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2025-04-13 17:44:52,101 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:44:52,101 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:52,101 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 17:44:52,101 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 17:44:52,101 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 17:44:52,102 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -623258836, now seen corresponding path program 1 times [2025-04-13 17:44:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:52,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273837] [2025-04-13 17:44:52,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:44:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:52,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:44:52,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:44:52,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:52,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:44:52,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:52,766 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273837] [2025-04-13 17:44:52,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273837] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:52,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316253898] [2025-04-13 17:44:52,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 17:44:52,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:52,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:52,769 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 17:44:52,772 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 17:44:52,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:44:52,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:44:52,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:44:52,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:52,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:44:52,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:53,118 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:44:53,118 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:44:53,142 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 17:44:53,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:53,481 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:44:53,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 195 treesize of output 195 [2025-04-13 17:44:54,081 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 17:44:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316253898] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:54,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:54,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 27 [2025-04-13 17:44:54,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102085478] [2025-04-13 17:44:54,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:54,082 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:44:54,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:54,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:44:54,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:44:54,083 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:55,123 INFO L93 Difference]: Finished difference Result 115 states and 234 transitions. [2025-04-13 17:44:55,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:44:55,126 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:44:55,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:55,127 INFO L225 Difference]: With dead ends: 115 [2025-04-13 17:44:55,127 INFO L226 Difference]: Without dead ends: 92 [2025-04-13 17:44:55,127 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=343, Invalid=2207, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:44:55,128 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 163 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:55,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 0 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:44:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-04-13 17:44:55,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2025-04-13 17:44:55,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 63 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 131 transitions. [2025-04-13 17:44:55,138 INFO L79 Accepts]: Start accepts. Automaton has 64 states and 131 transitions. Word has length 26 [2025-04-13 17:44:55,138 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:55,138 INFO L485 AbstractCegarLoop]: Abstraction has 64 states and 131 transitions. [2025-04-13 17:44:55,138 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.074074074074074) internal successors, (56), 28 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:55,138 INFO L278 IsEmpty]: Start isEmpty. Operand 64 states and 131 transitions. [2025-04-13 17:44:55,138 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:44:55,138 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:55,138 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 17:44:55,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 17:44:55,338 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:55,339 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 17:44:55,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1366651150, now seen corresponding path program 2 times [2025-04-13 17:44:55,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:55,339 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635226895] [2025-04-13 17:44:55,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:55,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:55,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:44:55,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:44:55,369 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:44:55,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:55,858 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 17:44:55,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:55,858 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635226895] [2025-04-13 17:44:55,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635226895] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:55,859 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191960499] [2025-04-13 17:44:55,859 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:44:55,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:55,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:55,861 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 17:44:55,863 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 17:44:55,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:44:55,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:44:55,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:44:55,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:55,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:44:55,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:56,191 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:44:56,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:44:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 17:44:56,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:56,613 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 17:44:56,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 190 [2025-04-13 17:44:57,402 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 17:44:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191960499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:44:57,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:44:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 21 [2025-04-13 17:44:57,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986409603] [2025-04-13 17:44:57,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:44:57,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:44:57,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:44:57,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:44:57,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:44:57,403 INFO L87 Difference]: Start difference. First operand 64 states and 131 transitions. Second operand has 22 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 22 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:44:58,321 INFO L93 Difference]: Finished difference Result 154 states and 334 transitions. [2025-04-13 17:44:58,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:44:58,321 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 17:44:58,321 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:44:58,322 INFO L225 Difference]: With dead ends: 154 [2025-04-13 17:44:58,322 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 17:44:58,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=296, Invalid=1510, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:44:58,323 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:44:58,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:44:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 17:44:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2025-04-13 17:44:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 2.175675675675676) internal successors, (161), 74 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:44:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 161 transitions. [2025-04-13 17:44:58,338 INFO L79 Accepts]: Start accepts. Automaton has 75 states and 161 transitions. Word has length 26 [2025-04-13 17:44:58,338 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:44:58,338 INFO L485 AbstractCegarLoop]: Abstraction has 75 states and 161 transitions. [2025-04-13 17:44:58,338 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 17:44:58,338 INFO L278 IsEmpty]: Start isEmpty. Operand 75 states and 161 transitions. [2025-04-13 17:44:58,338 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:44:58,338 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:44:58,338 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 17:44:58,345 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 17:44:58,539 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-13 17:44:58,539 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 17:44:58,539 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:44:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1316602270, now seen corresponding path program 3 times [2025-04-13 17:44:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:44:58,539 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257808954] [2025-04-13 17:44:58,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:58,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:44:58,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:44:58,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 17:44:58,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:44:58,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:58,921 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 17:44:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:44:58,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257808954] [2025-04-13 17:44:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257808954] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:44:58,921 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552453524] [2025-04-13 17:44:58,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:44:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:44:58,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:44:58,923 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 17:44:58,925 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 17:44:59,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:44:59,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 17:44:59,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:44:59,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:44:59,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:44:59,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:44:59,239 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:44:59,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:44:59,262 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 17:44:59,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:44:59,700 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 17:44:59,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 190 [2025-04-13 17:45:00,493 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 17:45:00,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552453524] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:00,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:00,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 17:45:00,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11710722] [2025-04-13 17:45:00,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:00,494 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:45:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:00,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:45:00,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:45:00,494 INFO L87 Difference]: Start difference. First operand 75 states and 161 transitions. Second operand has 21 states, 20 states have (on average 2.2) internal successors, (44), 21 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:02,538 INFO L93 Difference]: Finished difference Result 241 states and 488 transitions. [2025-04-13 17:45:02,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 17:45:02,538 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 17:45:02,538 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:02,539 INFO L225 Difference]: With dead ends: 241 [2025-04-13 17:45:02,539 INFO L226 Difference]: Without dead ends: 210 [2025-04-13 17:45:02,540 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=544, Invalid=2318, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:45:02,541 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 214 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:02,541 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 0 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:45:02,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-04-13 17:45:02,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 81. [2025-04-13 17:45:02,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 2.325) internal successors, (186), 80 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:02,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 186 transitions. [2025-04-13 17:45:02,567 INFO L79 Accepts]: Start accepts. Automaton has 81 states and 186 transitions. Word has length 26 [2025-04-13 17:45:02,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:02,567 INFO L485 AbstractCegarLoop]: Abstraction has 81 states and 186 transitions. [2025-04-13 17:45:02,568 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 17:45:02,568 INFO L278 IsEmpty]: Start isEmpty. Operand 81 states and 186 transitions. [2025-04-13 17:45:02,568 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:02,568 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:02,568 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 17:45:02,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 17:45:02,768 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-04-13 17:45:02,769 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 17:45:02,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:02,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1314065230, now seen corresponding path program 4 times [2025-04-13 17:45:02,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:02,769 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093199758] [2025-04-13 17:45:02,769 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:02,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:02,776 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:02,780 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 17:45:02,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:45:02,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:02,932 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 17:45:02,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:02,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093199758] [2025-04-13 17:45:02,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093199758] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:02,933 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564330869] [2025-04-13 17:45:02,933 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:02,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:02,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:02,935 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 17:45:02,936 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 17:45:03,020 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:03,028 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 17:45:03,028 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:45:03,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:03,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 17:45:03,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:03,112 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:45:03,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 91 treesize of output 52 [2025-04-13 17:45:03,138 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 17:45:03,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:03,252 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:03,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:45:03,775 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 17:45:03,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564330869] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:03,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:03,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 17:45:03,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45928589] [2025-04-13 17:45:03,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:03,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:45:03,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:03,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:45:03,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:45:03,776 INFO L87 Difference]: Start difference. First operand 81 states and 186 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:04,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:04,334 INFO L93 Difference]: Finished difference Result 189 states and 435 transitions. [2025-04-13 17:45:04,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:45:04,334 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:04,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:04,335 INFO L225 Difference]: With dead ends: 189 [2025-04-13 17:45:04,335 INFO L226 Difference]: Without dead ends: 172 [2025-04-13 17:45:04,336 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:45:04,336 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:04,336 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-04-13 17:45:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 95. [2025-04-13 17:45:04,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 2.5425531914893615) internal successors, (239), 94 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 239 transitions. [2025-04-13 17:45:04,388 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 239 transitions. Word has length 26 [2025-04-13 17:45:04,388 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:04,388 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 239 transitions. [2025-04-13 17:45:04,388 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:04,388 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 239 transitions. [2025-04-13 17:45:04,388 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:04,388 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:04,388 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 17:45:04,394 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 17:45:04,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-13 17:45:04,589 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 17:45:04,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1991128120, now seen corresponding path program 5 times [2025-04-13 17:45:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:04,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954464981] [2025-04-13 17:45:04,589 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:45:04,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:04,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:04,623 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:04,624 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:45:04,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:45:05,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:05,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954464981] [2025-04-13 17:45:05,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954464981] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:05,114 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688793418] [2025-04-13 17:45:05,114 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:45:05,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:05,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:05,117 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 17:45:05,117 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 17:45:05,197 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:05,228 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:05,228 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:45:05,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:05,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:45:05,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:05,381 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:45:05,381 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:45:05,405 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 17:45:05,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:05,554 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:05,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 193 [2025-04-13 17:45:05,957 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 17:45:05,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688793418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:05,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:05,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2025-04-13 17:45:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128729854] [2025-04-13 17:45:05,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:05,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:45:05,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:05,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:45:05,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:45:05,958 INFO L87 Difference]: Start difference. First operand 95 states and 239 transitions. Second operand has 22 states, 21 states have (on average 2.142857142857143) internal successors, (45), 22 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:06,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:06,708 INFO L93 Difference]: Finished difference Result 154 states and 361 transitions. [2025-04-13 17:45:06,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:45:06,708 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 17:45:06,708 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:06,709 INFO L225 Difference]: With dead ends: 154 [2025-04-13 17:45:06,709 INFO L226 Difference]: Without dead ends: 132 [2025-04-13 17:45:06,710 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=1727, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:45:06,710 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:06,710 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:45:06,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-13 17:45:06,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 98. [2025-04-13 17:45:06,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 2.5257731958762886) internal successors, (245), 97 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:06,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 245 transitions. [2025-04-13 17:45:06,740 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 245 transitions. Word has length 26 [2025-04-13 17:45:06,740 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:06,740 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 245 transitions. [2025-04-13 17:45:06,740 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 17:45:06,740 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 245 transitions. [2025-04-13 17:45:06,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:06,741 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:06,741 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 17:45:06,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-13 17:45:06,941 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:06,941 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 17:45:06,942 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:06,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2041177000, now seen corresponding path program 6 times [2025-04-13 17:45:06,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:06,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13958131] [2025-04-13 17:45:06,942 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:06,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:06,949 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:06,963 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 17:45:06,963 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:45:06,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:07,343 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 17:45:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:07,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13958131] [2025-04-13 17:45:07,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13958131] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:07,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337561686] [2025-04-13 17:45:07,345 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:07,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:07,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:07,346 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 17:45:07,348 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 17:45:07,447 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:07,471 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 17:45:07,471 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:45:07,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:07,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:45:07,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:07,737 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:45:07,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:45:07,758 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 17:45:07,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:07,904 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:07,905 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 17:45:09,185 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 17:45:09,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337561686] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:09,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:09,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2025-04-13 17:45:09,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487187195] [2025-04-13 17:45:09,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:09,186 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:45:09,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:09,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:45:09,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:45:09,187 INFO L87 Difference]: Start difference. First operand 98 states and 245 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:10,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:10,019 INFO L93 Difference]: Finished difference Result 169 states and 383 transitions. [2025-04-13 17:45:10,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:45:10,020 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:10,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:10,021 INFO L225 Difference]: With dead ends: 169 [2025-04-13 17:45:10,021 INFO L226 Difference]: Without dead ends: 138 [2025-04-13 17:45:10,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=295, Invalid=1511, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:45:10,021 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:10,022 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-04-13 17:45:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 99. [2025-04-13 17:45:10,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 2.5408163265306123) internal successors, (249), 98 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:10,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 249 transitions. [2025-04-13 17:45:10,053 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 249 transitions. Word has length 26 [2025-04-13 17:45:10,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:10,054 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 249 transitions. [2025-04-13 17:45:10,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:10,054 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 249 transitions. [2025-04-13 17:45:10,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:10,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:10,054 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 17:45:10,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 17:45:10,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:10,255 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 17:45:10,255 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash 322833294, now seen corresponding path program 7 times [2025-04-13 17:45:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:10,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765529798] [2025-04-13 17:45:10,255 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:10,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:10,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:45:10,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:10,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:10,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:10,870 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:45:10,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:10,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765529798] [2025-04-13 17:45:10,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765529798] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:10,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956441517] [2025-04-13 17:45:10,870 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:10,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:10,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:10,872 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 17:45:10,874 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 17:45:10,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:45:10,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:10,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:10,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:10,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 17:45:10,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:11,113 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:45:11,114 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:45:11,135 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 17:45:11,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:11,260 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:11,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 195 treesize of output 191 [2025-04-13 17:45:11,834 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 17:45:11,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956441517] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:11,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:11,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 25 [2025-04-13 17:45:11,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481044454] [2025-04-13 17:45:11,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:11,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:45:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:11,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:45:11,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=565, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:45:11,836 INFO L87 Difference]: Start difference. First operand 99 states and 249 transitions. Second operand has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:12,640 INFO L93 Difference]: Finished difference Result 175 states and 403 transitions. [2025-04-13 17:45:12,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:45:12,641 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:12,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:12,642 INFO L225 Difference]: With dead ends: 175 [2025-04-13 17:45:12,642 INFO L226 Difference]: Without dead ends: 150 [2025-04-13 17:45:12,642 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=293, Invalid=2059, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:45:12,643 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:12,643 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-04-13 17:45:12,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 107. [2025-04-13 17:45:12,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.650943396226415) internal successors, (281), 106 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:12,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 281 transitions. [2025-04-13 17:45:12,692 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 281 transitions. Word has length 26 [2025-04-13 17:45:12,692 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:12,692 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 281 transitions. [2025-04-13 17:45:12,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.84) internal successors, (46), 26 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:12,693 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 281 transitions. [2025-04-13 17:45:12,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:12,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:12,693 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 17:45:12,700 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 17:45:12,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 17:45:12,894 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 17:45:12,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:12,894 INFO L85 PathProgramCache]: Analyzing trace with hash 325370334, now seen corresponding path program 8 times [2025-04-13 17:45:12,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:12,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507562712] [2025-04-13 17:45:12,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:12,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:12,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:12,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:12,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:12,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:13,399 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 17:45:13,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:13,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507562712] [2025-04-13 17:45:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507562712] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:13,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339072249] [2025-04-13 17:45:13,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:13,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:13,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:13,401 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 17:45:13,404 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 17:45:13,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:13,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:13,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:13,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:13,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:45:13,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:13,748 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:45:13,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:45:13,770 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 17:45:13,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:13,910 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:13,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:45:14,401 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 17:45:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339072249] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:14,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 25 [2025-04-13 17:45:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199228087] [2025-04-13 17:45:14,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:14,402 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:45:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:14,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:45:14,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:45:14,403 INFO L87 Difference]: Start difference. First operand 107 states and 281 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:15,182 INFO L93 Difference]: Finished difference Result 171 states and 390 transitions. [2025-04-13 17:45:15,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:45:15,184 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:15,184 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:15,185 INFO L225 Difference]: With dead ends: 171 [2025-04-13 17:45:15,185 INFO L226 Difference]: Without dead ends: 143 [2025-04-13 17:45:15,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=375, Invalid=2175, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:45:15,186 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 161 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:15,186 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 0 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:15,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-04-13 17:45:15,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 107. [2025-04-13 17:45:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 2.6132075471698113) internal successors, (277), 106 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:15,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 277 transitions. [2025-04-13 17:45:15,227 INFO L79 Accepts]: Start accepts. Automaton has 107 states and 277 transitions. Word has length 26 [2025-04-13 17:45:15,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:15,228 INFO L485 AbstractCegarLoop]: Abstraction has 107 states and 277 transitions. [2025-04-13 17:45:15,228 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:15,228 INFO L278 IsEmpty]: Start isEmpty. Operand 107 states and 277 transitions. [2025-04-13 17:45:15,228 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:15,228 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:15,228 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 17:45:15,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 17:45:15,431 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-13 17:45:15,431 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 17:45:15,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:15,431 INFO L85 PathProgramCache]: Analyzing trace with hash 436192854, now seen corresponding path program 9 times [2025-04-13 17:45:15,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:15,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904004754] [2025-04-13 17:45:15,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:15,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:15,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:15,464 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 17:45:15,464 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:15,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:15,841 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 17:45:15,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:15,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904004754] [2025-04-13 17:45:15,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904004754] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:15,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604320931] [2025-04-13 17:45:15,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:15,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:15,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:15,843 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 17:45:15,845 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 17:45:15,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:15,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 17:45:15,966 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:15,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:15,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:45:15,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:16,164 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:45:16,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 42 [2025-04-13 17:45:16,190 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 17:45:16,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:16,338 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:16,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:45:16,975 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 17:45:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604320931] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:16,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:16,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-13 17:45:16,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863053278] [2025-04-13 17:45:16,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:16,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:45:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:16,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:45:16,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:45:16,977 INFO L87 Difference]: Start difference. First operand 107 states and 277 transitions. Second operand has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:17,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:17,644 INFO L93 Difference]: Finished difference Result 147 states and 357 transitions. [2025-04-13 17:45:17,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:45:17,645 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:17,645 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:17,646 INFO L225 Difference]: With dead ends: 147 [2025-04-13 17:45:17,646 INFO L226 Difference]: Without dead ends: 125 [2025-04-13 17:45:17,647 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=1457, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:45:17,647 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:17,647 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-04-13 17:45:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 111. [2025-04-13 17:45:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.590909090909091) internal successors, (285), 110 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 285 transitions. [2025-04-13 17:45:17,695 INFO L79 Accepts]: Start accepts. Automaton has 111 states and 285 transitions. Word has length 26 [2025-04-13 17:45:17,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:17,695 INFO L485 AbstractCegarLoop]: Abstraction has 111 states and 285 transitions. [2025-04-13 17:45:17,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.217391304347826) internal successors, (51), 24 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:17,695 INFO L278 IsEmpty]: Start isEmpty. Operand 111 states and 285 transitions. [2025-04-13 17:45:17,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:17,696 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:17,696 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 17:45:17,703 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 17:45:17,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-04-13 17:45:17,896 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 17:45:17,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash -536691308, now seen corresponding path program 10 times [2025-04-13 17:45:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:17,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279371510] [2025-04-13 17:45:17,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:17,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:17,907 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:17,911 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 17:45:17,911 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:45:17,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:18,103 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 17:45:18,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:18,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279371510] [2025-04-13 17:45:18,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279371510] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:18,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129859183] [2025-04-13 17:45:18,103 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:18,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:18,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:18,105 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 17:45:18,106 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 17:45:18,209 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:18,216 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 17:45:18,216 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:45:18,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:18,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:45:18,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:18,333 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:45:18,334 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:45:18,354 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 17:45:18,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:18,514 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:18,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:45:18,961 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 17:45:18,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129859183] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:18,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:18,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-04-13 17:45:18,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529557431] [2025-04-13 17:45:18,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:18,962 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:45:18,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:18,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:45:18,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:45:18,962 INFO L87 Difference]: Start difference. First operand 111 states and 285 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:19,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:19,753 INFO L93 Difference]: Finished difference Result 192 states and 465 transitions. [2025-04-13 17:45:19,757 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:45:19,757 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:19,757 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:19,758 INFO L225 Difference]: With dead ends: 192 [2025-04-13 17:45:19,758 INFO L226 Difference]: Without dead ends: 166 [2025-04-13 17:45:19,758 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=1200, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:45:19,762 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 116 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:19,762 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 0 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-04-13 17:45:19,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 120. [2025-04-13 17:45:19,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 2.6554621848739495) internal successors, (316), 119 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 316 transitions. [2025-04-13 17:45:19,824 INFO L79 Accepts]: Start accepts. Automaton has 120 states and 316 transitions. Word has length 26 [2025-04-13 17:45:19,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:19,824 INFO L485 AbstractCegarLoop]: Abstraction has 120 states and 316 transitions. [2025-04-13 17:45:19,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:19,824 INFO L278 IsEmpty]: Start isEmpty. Operand 120 states and 316 transitions. [2025-04-13 17:45:19,824 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:19,824 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:19,824 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 17:45:19,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 17:45:20,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-04-13 17:45:20,025 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 17:45:20,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:20,025 INFO L85 PathProgramCache]: Analyzing trace with hash -484105388, now seen corresponding path program 11 times [2025-04-13 17:45:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:20,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698724201] [2025-04-13 17:45:20,026 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:45:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:20,034 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:20,049 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:20,049 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:45:20,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:45:20,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:20,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698724201] [2025-04-13 17:45:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698724201] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:20,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48543715] [2025-04-13 17:45:20,433 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:45:20,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:20,436 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 17:45:20,443 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 17:45:20,544 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:20,695 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:20,695 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:45:20,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:20,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:45:20,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:20,875 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:45:20,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:45:20,905 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 17:45:20,905 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:21,013 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:21,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 211 treesize of output 207 [2025-04-13 17:45:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:45:21,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48543715] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:21,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:21,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 22 [2025-04-13 17:45:21,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839389335] [2025-04-13 17:45:21,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:21,389 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:45:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:21,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:45:21,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:45:21,390 INFO L87 Difference]: Start difference. First operand 120 states and 316 transitions. Second operand has 23 states, 22 states have (on average 2.0) 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 17:45:22,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:22,085 INFO L93 Difference]: Finished difference Result 178 states and 425 transitions. [2025-04-13 17:45:22,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:45:22,085 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) 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 26 [2025-04-13 17:45:22,085 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:22,086 INFO L225 Difference]: With dead ends: 178 [2025-04-13 17:45:22,086 INFO L226 Difference]: Without dead ends: 161 [2025-04-13 17:45:22,087 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1481, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:45:22,087 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:22,087 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 0 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:22,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-04-13 17:45:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 122. [2025-04-13 17:45:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.669421487603306) internal successors, (323), 121 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 323 transitions. [2025-04-13 17:45:22,143 INFO L79 Accepts]: Start accepts. Automaton has 122 states and 323 transitions. Word has length 26 [2025-04-13 17:45:22,143 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:22,143 INFO L485 AbstractCegarLoop]: Abstraction has 122 states and 323 transitions. [2025-04-13 17:45:22,143 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) 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 17:45:22,143 INFO L278 IsEmpty]: Start isEmpty. Operand 122 states and 323 transitions. [2025-04-13 17:45:22,144 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:22,144 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:22,144 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 17:45:22,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 17:45:22,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:22,345 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 17:45:22,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:22,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2089981162, now seen corresponding path program 12 times [2025-04-13 17:45:22,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:22,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545163543] [2025-04-13 17:45:22,345 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:22,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:22,353 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:22,362 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 17:45:22,362 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:45:22,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:22,690 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 17:45:22,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:22,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545163543] [2025-04-13 17:45:22,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545163543] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:22,691 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491594503] [2025-04-13 17:45:22,691 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:22,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:22,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:22,693 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 17:45:22,693 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 17:45:22,792 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:22,812 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 17:45:22,812 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:45:22,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:22,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-04-13 17:45:22,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:22,996 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:45:22,996 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:45:23,014 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 17:45:23,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:23,426 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:45:23,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 225 treesize of output 263 [2025-04-13 17:45:25,571 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 17:45:25,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491594503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:25,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:25,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 17:45:25,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865604526] [2025-04-13 17:45:25,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:25,572 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 17:45:25,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:25,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 17:45:25,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2025-04-13 17:45:25,572 INFO L87 Difference]: Start difference. First operand 122 states and 323 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:27,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:27,993 INFO L93 Difference]: Finished difference Result 280 states and 655 transitions. [2025-04-13 17:45:27,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:45:27,993 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:27,993 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:27,995 INFO L225 Difference]: With dead ends: 280 [2025-04-13 17:45:27,995 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 17:45:27,995 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=537, Invalid=3003, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 17:45:27,996 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 216 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:27,996 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 0 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:27,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 17:45:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 138. [2025-04-13 17:45:28,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.81021897810219) internal successors, (385), 137 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 385 transitions. [2025-04-13 17:45:28,059 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 385 transitions. Word has length 26 [2025-04-13 17:45:28,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:28,060 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 385 transitions. [2025-04-13 17:45:28,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:28,060 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 385 transitions. [2025-04-13 17:45:28,060 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:28,060 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:28,060 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 17:45:28,067 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 17:45:28,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:28,261 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 17:45:28,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash 2092518202, now seen corresponding path program 13 times [2025-04-13 17:45:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:28,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225053997] [2025-04-13 17:45:28,261 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:28,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:45:28,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:28,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:28,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:45:28,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:28,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225053997] [2025-04-13 17:45:28,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225053997] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:28,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999884958] [2025-04-13 17:45:28,753 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:28,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:28,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:28,755 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 17:45:28,755 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 17:45:28,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 17:45:28,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:28,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:28,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:28,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 17:45:28,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:29,042 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:45:29,043 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:45:29,067 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 17:45:29,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:29,192 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:29,193 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 222 [2025-04-13 17:45:30,007 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 17:45:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999884958] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:30,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 27 [2025-04-13 17:45:30,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103318944] [2025-04-13 17:45:30,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:30,007 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:45:30,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:30,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:45:30,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:45:30,008 INFO L87 Difference]: Start difference. First operand 138 states and 385 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:31,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:31,462 INFO L93 Difference]: Finished difference Result 264 states and 619 transitions. [2025-04-13 17:45:31,462 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 17:45:31,462 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:31,462 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:31,464 INFO L225 Difference]: With dead ends: 264 [2025-04-13 17:45:31,464 INFO L226 Difference]: Without dead ends: 225 [2025-04-13 17:45:31,465 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=608, Invalid=4362, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 17:45:31,465 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 208 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:31,465 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 0 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:45:31,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-04-13 17:45:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 140. [2025-04-13 17:45:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.79136690647482) internal successors, (388), 139 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 388 transitions. [2025-04-13 17:45:31,535 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 388 transitions. Word has length 26 [2025-04-13 17:45:31,535 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:31,535 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 388 transitions. [2025-04-13 17:45:31,535 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:31,535 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 388 transitions. [2025-04-13 17:45:31,536 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:31,536 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:31,536 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 17:45:31,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 17:45:31,736 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:31,736 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 17:45:31,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:31,737 INFO L85 PathProgramCache]: Analyzing trace with hash -2091626574, now seen corresponding path program 14 times [2025-04-13 17:45:31,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:31,737 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634724644] [2025-04-13 17:45:31,737 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:31,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:31,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:31,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:31,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:31,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:32,195 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 17:45:32,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:32,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634724644] [2025-04-13 17:45:32,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634724644] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:32,195 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972144799] [2025-04-13 17:45:32,195 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:32,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:32,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:32,197 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 17:45:32,199 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 17:45:32,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:32,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:32,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:32,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:32,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:45:32,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:32,590 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:45:32,591 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:45:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 17:45:32,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:32,748 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:32,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 215 treesize of output 213 [2025-04-13 17:45:33,293 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 17:45:33,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972144799] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:33,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:33,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 25 [2025-04-13 17:45:33,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558550498] [2025-04-13 17:45:33,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:33,293 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:45:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:33,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:45:33,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=561, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:45:33,294 INFO L87 Difference]: Start difference. First operand 140 states and 388 transitions. Second operand has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:33,991 INFO L93 Difference]: Finished difference Result 187 states and 486 transitions. [2025-04-13 17:45:33,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:45:33,991 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:33,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:33,992 INFO L225 Difference]: With dead ends: 187 [2025-04-13 17:45:33,992 INFO L226 Difference]: Without dead ends: 162 [2025-04-13 17:45:33,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1559, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:45:33,993 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:33,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-04-13 17:45:34,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 140. [2025-04-13 17:45:34,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.776978417266187) internal successors, (386), 139 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:34,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 386 transitions. [2025-04-13 17:45:34,059 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 386 transitions. Word has length 26 [2025-04-13 17:45:34,059 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:34,059 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 386 transitions. [2025-04-13 17:45:34,059 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.08) internal successors, (52), 26 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:34,059 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 386 transitions. [2025-04-13 17:45:34,059 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:34,059 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:34,059 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 17:45:34,066 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 17:45:34,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:34,260 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 17:45:34,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1216240482, now seen corresponding path program 15 times [2025-04-13 17:45:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:34,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280533401] [2025-04-13 17:45:34,260 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:34,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:34,276 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 17:45:34,277 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:34,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:34,567 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 17:45:34,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:34,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280533401] [2025-04-13 17:45:34,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280533401] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:34,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402726723] [2025-04-13 17:45:34,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:34,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:34,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:34,570 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 17:45:34,570 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 17:45:34,678 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:34,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 20 of 26 statements. [2025-04-13 17:45:34,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:34,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:34,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:45:34,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:34,904 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:45:34,904 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:45:34,923 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 17:45:34,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:35,289 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 17:45:35,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 138 treesize of output 188 [2025-04-13 17:45:36,356 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 17:45:36,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402726723] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:36,356 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:36,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 20 [2025-04-13 17:45:36,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727338494] [2025-04-13 17:45:36,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:36,357 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:45:36,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:36,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:45:36,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:45:36,357 INFO L87 Difference]: Start difference. First operand 140 states and 386 transitions. Second operand has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:38,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:38,611 INFO L93 Difference]: Finished difference Result 339 states and 817 transitions. [2025-04-13 17:45:38,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:45:38,612 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:38,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:38,613 INFO L225 Difference]: With dead ends: 339 [2025-04-13 17:45:38,613 INFO L226 Difference]: Without dead ends: 308 [2025-04-13 17:45:38,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=654, Invalid=3006, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 17:45:38,614 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:38,615 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 0 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:45:38,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-04-13 17:45:38,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 146. [2025-04-13 17:45:38,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.820689655172414) internal successors, (409), 145 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:38,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 409 transitions. [2025-04-13 17:45:38,693 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 409 transitions. Word has length 26 [2025-04-13 17:45:38,693 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:38,693 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 409 transitions. [2025-04-13 17:45:38,693 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.1) internal successors, (42), 21 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:38,693 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 409 transitions. [2025-04-13 17:45:38,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:38,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:38,693 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 17:45:38,699 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 17:45:38,894 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:38,894 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 17:45:38,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:38,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1218777522, now seen corresponding path program 16 times [2025-04-13 17:45:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:38,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658737693] [2025-04-13 17:45:38,894 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:38,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:38,903 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:38,907 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 17:45:38,907 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:45:38,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:39,072 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 17:45:39,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:39,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658737693] [2025-04-13 17:45:39,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658737693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:39,072 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210246211] [2025-04-13 17:45:39,072 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:39,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:39,074 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 17:45:39,077 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 17:45:39,198 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 17:45:39,205 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 13 of 26 statements. [2025-04-13 17:45:39,205 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:45:39,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:39,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 17:45:39,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:39,280 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:45:39,281 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:45:39,301 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 17:45:39,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:39,407 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:39,407 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:45:39,816 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 17:45:39,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210246211] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:39,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:39,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-13 17:45:39,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134731514] [2025-04-13 17:45:39,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:39,817 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 17:45:39,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:39,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 17:45:39,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:45:39,818 INFO L87 Difference]: Start difference. First operand 146 states and 409 transitions. Second operand has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:40,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:40,492 INFO L93 Difference]: Finished difference Result 247 states and 608 transitions. [2025-04-13 17:45:40,492 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 17:45:40,492 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:40,492 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:40,493 INFO L225 Difference]: With dead ends: 247 [2025-04-13 17:45:40,493 INFO L226 Difference]: Without dead ends: 230 [2025-04-13 17:45:40,494 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:45:40,494 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:40,494 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:40,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-04-13 17:45:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 146. [2025-04-13 17:45:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.806896551724138) internal successors, (407), 145 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:40,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 407 transitions. [2025-04-13 17:45:40,568 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 407 transitions. Word has length 26 [2025-04-13 17:45:40,568 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:40,568 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 407 transitions. [2025-04-13 17:45:40,568 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:40,568 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 407 transitions. [2025-04-13 17:45:40,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:40,569 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:40,569 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 17:45:40,575 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 17:45:40,769 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 17:45:40,769 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 17:45:40,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:40,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1329600042, now seen corresponding path program 17 times [2025-04-13 17:45:40,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:40,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57108348] [2025-04-13 17:45:40,770 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:45:40,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:40,778 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:40,797 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:40,797 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:45:40,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:45:41,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:41,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57108348] [2025-04-13 17:45:41,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57108348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:41,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129726895] [2025-04-13 17:45:41,208 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:45:41,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:41,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:41,210 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 17:45:41,212 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 17:45:41,328 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:41,391 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 17:45:41,391 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:45:41,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:41,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:45:41,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:41,573 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:45:41,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:45:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:45:41,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:41,751 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:41,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 209 [2025-04-13 17:45:42,130 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 17:45:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129726895] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:42,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 26 [2025-04-13 17:45:42,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536675684] [2025-04-13 17:45:42,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:42,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:45:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:42,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:45:42,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:45:42,131 INFO L87 Difference]: Start difference. First operand 146 states and 407 transitions. Second operand has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 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 17:45:42,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:42,896 INFO L93 Difference]: Finished difference Result 220 states and 570 transitions. [2025-04-13 17:45:42,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:45:42,897 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:42,897 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:42,898 INFO L225 Difference]: With dead ends: 220 [2025-04-13 17:45:42,898 INFO L226 Difference]: Without dead ends: 195 [2025-04-13 17:45:42,898 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:45:42,899 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 84 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:42,899 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 0 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-04-13 17:45:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2025-04-13 17:45:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.793103448275862) internal successors, (405), 145 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 405 transitions. [2025-04-13 17:45:42,985 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 405 transitions. Word has length 26 [2025-04-13 17:45:42,985 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:42,985 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 405 transitions. [2025-04-13 17:45:42,985 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 27 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 17:45:42,985 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 405 transitions. [2025-04-13 17:45:42,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-13 17:45:42,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:42,985 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 17:45:42,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-04-13 17:45:43,186 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 17:45:43,186 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 17:45:43,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:43,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1329005396, now seen corresponding path program 18 times [2025-04-13 17:45:43,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:43,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54427462] [2025-04-13 17:45:43,186 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:43,196 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:43,209 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 17:45:43,209 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:45:43,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:43,633 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 17:45:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:43,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54427462] [2025-04-13 17:45:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54427462] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:43,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117845534] [2025-04-13 17:45:43,634 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:43,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:43,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:43,636 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 17:45:43,636 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 17:45:43,750 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 4 equivalence classes. [2025-04-13 17:45:43,769 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 26 statements. [2025-04-13 17:45:43,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:45:43,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:43,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:45:43,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:44,015 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:45:44,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 75 treesize of output 47 [2025-04-13 17:45:44,041 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 17:45:44,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:44,213 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:45:44,213 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 192 treesize of output 192 [2025-04-13 17:45:44,696 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:45:44,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117845534] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:44,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:44,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 24 [2025-04-13 17:45:44,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229920379] [2025-04-13 17:45:44,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:44,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:45:44,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:44,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:45:44,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:45:44,698 INFO L87 Difference]: Start difference. First operand 146 states and 405 transitions. Second operand has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:45,634 INFO L93 Difference]: Finished difference Result 216 states and 558 transitions. [2025-04-13 17:45:45,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-04-13 17:45:45,635 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-13 17:45:45,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:45,636 INFO L225 Difference]: With dead ends: 216 [2025-04-13 17:45:45,636 INFO L226 Difference]: Without dead ends: 189 [2025-04-13 17:45:45,636 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=235, Invalid=1487, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:45:45,637 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:45,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 0 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-04-13 17:45:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2025-04-13 17:45:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.7588652482269502) internal successors, (389), 141 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 389 transitions. [2025-04-13 17:45:45,728 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 389 transitions. Word has length 26 [2025-04-13 17:45:45,728 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:45,729 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 389 transitions. [2025-04-13 17:45:45,729 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.125) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:45,729 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 389 transitions. [2025-04-13 17:45:45,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:45,729 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:45,729 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 17:45:45,736 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 17:45:45,933 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-04-13 17:45:45,933 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 17:45:45,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:45,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1153037533, now seen corresponding path program 19 times [2025-04-13 17:45:45,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:45,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351371029] [2025-04-13 17:45:45,933 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:45,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:45,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 17:45:45,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:45,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:45,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:46,376 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:45:46,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:46,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351371029] [2025-04-13 17:45:46,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351371029] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:46,376 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059538892] [2025-04-13 17:45:46,376 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:46,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:46,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:46,378 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 17:45:46,379 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 17:45:46,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 17:45:46,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:46,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:46,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:46,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:45:46,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:46,595 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 17:45:46,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:46,696 INFO L325 Elim1Store]: treesize reduction 11, result has 84.9 percent of original size [2025-04-13 17:45:46,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 41 treesize of output 74 [2025-04-13 17:45:46,722 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 17:45:46,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059538892] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:46,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:46,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 22 [2025-04-13 17:45:46,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274063338] [2025-04-13 17:45:46,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:46,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:45:46,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:46,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:45:46,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:45:46,723 INFO L87 Difference]: Start difference. First operand 142 states and 389 transitions. Second operand has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:47,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:47,240 INFO L93 Difference]: Finished difference Result 196 states and 516 transitions. [2025-04-13 17:45:47,240 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:45:47,241 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 17:45:47,241 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:47,242 INFO L225 Difference]: With dead ends: 196 [2025-04-13 17:45:47,242 INFO L226 Difference]: Without dead ends: 189 [2025-04-13 17:45:47,242 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:45:47,243 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:47,243 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-04-13 17:45:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 140. [2025-04-13 17:45:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 2.7553956834532376) internal successors, (383), 139 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:47,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 383 transitions. [2025-04-13 17:45:47,347 INFO L79 Accepts]: Start accepts. Automaton has 140 states and 383 transitions. Word has length 27 [2025-04-13 17:45:47,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:47,347 INFO L485 AbstractCegarLoop]: Abstraction has 140 states and 383 transitions. [2025-04-13 17:45:47,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 22 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:47,347 INFO L278 IsEmpty]: Start isEmpty. Operand 140 states and 383 transitions. [2025-04-13 17:45:47,347 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:47,347 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:47,347 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 17:45:47,354 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 17:45:47,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:47,549 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 17:45:47,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash -474956887, now seen corresponding path program 20 times [2025-04-13 17:45:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:47,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895926636] [2025-04-13 17:45:47,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:47,558 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:45:47,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:47,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:47,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:47,842 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 17:45:47,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:47,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895926636] [2025-04-13 17:45:47,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895926636] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:47,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687825878] [2025-04-13 17:45:47,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:47,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:47,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:47,844 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 17:45:47,846 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 17:45:47,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:45:48,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:48,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:48,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:48,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 17:45:48,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-04-13 17:45:48,230 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:48,418 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 17:45:48,419 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 17:45:48,526 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 17:45:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687825878] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:48,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:48,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-04-13 17:45:48,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341079343] [2025-04-13 17:45:48,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:48,526 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:45:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:48,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:45:48,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:45:48,527 INFO L87 Difference]: Start difference. First operand 140 states and 383 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:49,044 INFO L93 Difference]: Finished difference Result 203 states and 523 transitions. [2025-04-13 17:45:49,044 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:45:49,044 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 17:45:49,044 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:49,045 INFO L225 Difference]: With dead ends: 203 [2025-04-13 17:45:49,045 INFO L226 Difference]: Without dead ends: 196 [2025-04-13 17:45:49,046 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:45:49,046 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:49,046 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:49,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-04-13 17:45:49,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 138. [2025-04-13 17:45:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 2.7445255474452557) internal successors, (376), 137 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 376 transitions. [2025-04-13 17:45:49,125 INFO L79 Accepts]: Start accepts. Automaton has 138 states and 376 transitions. Word has length 27 [2025-04-13 17:45:49,125 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:49,125 INFO L485 AbstractCegarLoop]: Abstraction has 138 states and 376 transitions. [2025-04-13 17:45:49,125 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:49,125 INFO L278 IsEmpty]: Start isEmpty. Operand 138 states and 376 transitions. [2025-04-13 17:45:49,125 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:49,125 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:49,125 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 17:45:49,132 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 17:45:49,326 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 17:45:49,326 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 17:45:49,326 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:49,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2101666703, now seen corresponding path program 21 times [2025-04-13 17:45:49,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:49,326 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912382518] [2025-04-13 17:45:49,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:49,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:49,335 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 17:45:49,349 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 17:45:49,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:49,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:49,599 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 17:45:49,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:49,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912382518] [2025-04-13 17:45:49,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912382518] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:49,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670419296] [2025-04-13 17:45:49,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:49,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:49,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:49,601 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 17:45:49,602 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 17:45:49,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 17:45:49,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 17:45:49,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:49,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:49,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:45:49,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:49,847 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 17:45:49,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:49,914 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:45:49,915 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 17:45:49,990 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 17:45:49,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670419296] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:49,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:49,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 23 [2025-04-13 17:45:49,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049061263] [2025-04-13 17:45:49,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:49,990 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:45:49,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:49,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:45:49,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:45:49,991 INFO L87 Difference]: Start difference. First operand 138 states and 376 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 17:45:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:50,593 INFO L93 Difference]: Finished difference Result 218 states and 545 transitions. [2025-04-13 17:45:50,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:45:50,593 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 17:45:50,593 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:50,594 INFO L225 Difference]: With dead ends: 218 [2025-04-13 17:45:50,595 INFO L226 Difference]: Without dead ends: 211 [2025-04-13 17:45:50,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=881, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:45:50,595 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 89 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:50,595 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 0 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:50,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-13 17:45:50,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 142. [2025-04-13 17:45:50,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.765957446808511) internal successors, (390), 141 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 390 transitions. [2025-04-13 17:45:50,678 INFO L79 Accepts]: Start accepts. Automaton has 142 states and 390 transitions. Word has length 27 [2025-04-13 17:45:50,678 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:50,678 INFO L485 AbstractCegarLoop]: Abstraction has 142 states and 390 transitions. [2025-04-13 17:45:50,678 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 17:45:50,678 INFO L278 IsEmpty]: Start isEmpty. Operand 142 states and 390 transitions. [2025-04-13 17:45:50,678 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:50,678 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:50,678 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 17:45:50,685 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 17:45:50,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 17:45:50,879 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 17:45:50,879 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2107413140, now seen corresponding path program 22 times [2025-04-13 17:45:50,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:50,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16869226] [2025-04-13 17:45:50,879 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:50,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:50,887 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:45:50,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 27 statements. [2025-04-13 17:45:50,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:45:50,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:50,974 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 17:45:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:50,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16869226] [2025-04-13 17:45:50,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16869226] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:50,974 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879040343] [2025-04-13 17:45:50,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:45:50,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:50,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:50,976 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 17:45:50,977 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 17:45:51,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:45:51,107 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 14 of 27 statements. [2025-04-13 17:45:51,108 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:45:51,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:51,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-04-13 17:45:51,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:51,147 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 17:45:51,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:51,212 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:45:51,212 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 17:45:51,259 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 17:45:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879040343] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:51,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:51,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 17:45:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474737545] [2025-04-13 17:45:51,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:51,260 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 17:45:51,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:51,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 17:45:51,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-04-13 17:45:51,260 INFO L87 Difference]: Start difference. First operand 142 states and 390 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:51,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:51,664 INFO L93 Difference]: Finished difference Result 217 states and 541 transitions. [2025-04-13 17:45:51,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 17:45:51,664 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 17:45:51,664 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:51,665 INFO L225 Difference]: With dead ends: 217 [2025-04-13 17:45:51,665 INFO L226 Difference]: Without dead ends: 206 [2025-04-13 17:45:51,666 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 17:45:51,666 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:51,666 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-04-13 17:45:51,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 136. [2025-04-13 17:45:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.688888888888889) internal successors, (363), 135 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:51,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 363 transitions. [2025-04-13 17:45:51,745 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 363 transitions. Word has length 27 [2025-04-13 17:45:51,745 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:51,745 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 363 transitions. [2025-04-13 17:45:51,745 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:51,745 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 363 transitions. [2025-04-13 17:45:51,745 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:51,745 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:51,745 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 17:45:51,752 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 17:45:51,946 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:51,946 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 17:45:51,946 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:51,946 INFO L85 PathProgramCache]: Analyzing trace with hash 484399459, now seen corresponding path program 23 times [2025-04-13 17:45:51,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:51,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664428551] [2025-04-13 17:45:51,947 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:45:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:51,956 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 17:45:51,970 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:51,970 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:45:51,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:45:52,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:52,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664428551] [2025-04-13 17:45:52,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664428551] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:52,286 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043380113] [2025-04-13 17:45:52,286 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:45:52,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:52,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:52,288 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 17:45:52,290 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 17:45:52,426 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 27 statements into 4 equivalence classes. [2025-04-13 17:45:52,493 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:52,493 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:45:52,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:52,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 17:45:52,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:52,583 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 17:45:52,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:52,668 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:45:52,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select 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 17:45:52,720 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 17:45:52,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043380113] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:52,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:52,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2025-04-13 17:45:52,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033001849] [2025-04-13 17:45:52,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:52,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:45:52,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:52,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:45:52,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:45:52,721 INFO L87 Difference]: Start difference. First operand 136 states and 363 transitions. Second operand has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 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 17:45:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:53,254 INFO L93 Difference]: Finished difference Result 170 states and 445 transitions. [2025-04-13 17:45:53,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:45:53,254 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 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 27 [2025-04-13 17:45:53,254 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:53,255 INFO L225 Difference]: With dead ends: 170 [2025-04-13 17:45:53,255 INFO L226 Difference]: Without dead ends: 163 [2025-04-13 17:45:53,255 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:45:53,256 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:53,256 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-04-13 17:45:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 136. [2025-04-13 17:45:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 2.688888888888889) internal successors, (363), 135 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 363 transitions. [2025-04-13 17:45:53,336 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 363 transitions. Word has length 27 [2025-04-13 17:45:53,336 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:53,336 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 363 transitions. [2025-04-13 17:45:53,336 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.5) internal successors, (55), 22 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 17:45:53,336 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 363 transitions. [2025-04-13 17:45:53,336 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:53,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:53,336 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 17:45:53,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 17:45:53,537 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:53,537 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 17:45:53,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -568591481, now seen corresponding path program 24 times [2025-04-13 17:45:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:53,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304303906] [2025-04-13 17:45:53,537 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:53,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:53,545 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 17:45:53,555 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 27 statements. [2025-04-13 17:45:53,556 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:45:53,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:53,814 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 17:45:53,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:53,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304303906] [2025-04-13 17:45:53,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304303906] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:53,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132491784] [2025-04-13 17:45:53,814 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:45:53,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:53,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:53,816 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 17:45:53,818 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 17:45:53,950 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 27 statements into 4 equivalence classes. [2025-04-13 17:45:53,969 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 23 of 27 statements. [2025-04-13 17:45:53,970 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:45:53,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:53,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:45:53,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:54,040 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 17:45:54,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:54,125 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:45:54,125 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 17:45:54,169 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 17:45:54,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132491784] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:54,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:54,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 16 [2025-04-13 17:45:54,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158473040] [2025-04-13 17:45:54,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:54,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 17:45:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:54,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 17:45:54,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2025-04-13 17:45:54,170 INFO L87 Difference]: Start difference. First operand 136 states and 363 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:54,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:54,544 INFO L93 Difference]: Finished difference Result 171 states and 452 transitions. [2025-04-13 17:45:54,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 17:45:54,544 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 17:45:54,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:54,545 INFO L225 Difference]: With dead ends: 171 [2025-04-13 17:45:54,545 INFO L226 Difference]: Without dead ends: 164 [2025-04-13 17:45:54,545 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:45:54,546 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:54,546 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 0 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 17:45:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-04-13 17:45:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 133. [2025-04-13 17:45:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.6742424242424243) internal successors, (353), 132 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 353 transitions. [2025-04-13 17:45:54,625 INFO L79 Accepts]: Start accepts. Automaton has 133 states and 353 transitions. Word has length 27 [2025-04-13 17:45:54,625 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:54,625 INFO L485 AbstractCegarLoop]: Abstraction has 133 states and 353 transitions. [2025-04-13 17:45:54,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:54,625 INFO L278 IsEmpty]: Start isEmpty. Operand 133 states and 353 transitions. [2025-04-13 17:45:54,625 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:54,626 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:54,626 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 17:45:54,633 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 17:45:54,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-13 17:45:54,828 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 17:45:54,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2093919562, now seen corresponding path program 25 times [2025-04-13 17:45:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:54,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451001844] [2025-04-13 17:45:54,828 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:54,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 17:45:54,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:54,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:54,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 17:45:55,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:55,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451001844] [2025-04-13 17:45:55,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451001844] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:55,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308989931] [2025-04-13 17:45:55,325 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:45:55,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:55,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:55,327 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 17:45:55,329 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 17:45:55,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 17:45:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:45:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:55,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 17:45:55,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:55,577 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 17:45:55,577 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:55,715 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 17:45:55,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 171 [2025-04-13 17:45:55,945 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 17:45:55,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308989931] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:55,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 25 [2025-04-13 17:45:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376461405] [2025-04-13 17:45:55,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:55,945 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:45:55,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:55,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:45:55,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:45:55,946 INFO L87 Difference]: Start difference. First operand 133 states and 353 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 17:45:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:56,763 INFO L93 Difference]: Finished difference Result 242 states and 576 transitions. [2025-04-13 17:45:56,764 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:45:56,764 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.84) internal successors, (46), 25 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 17:45:56,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:56,765 INFO L225 Difference]: With dead ends: 242 [2025-04-13 17:45:56,765 INFO L226 Difference]: Without dead ends: 228 [2025-04-13 17:45:56,766 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=1534, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:45:56,766 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:56,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:45:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-04-13 17:45:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 146. [2025-04-13 17:45:56,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.7517241379310344) internal successors, (399), 145 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:56,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 399 transitions. [2025-04-13 17:45:56,863 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 399 transitions. Word has length 27 [2025-04-13 17:45:56,863 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:56,863 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 399 transitions. [2025-04-13 17:45:56,863 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 17:45:56,863 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 399 transitions. [2025-04-13 17:45:56,864 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:56,864 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:56,864 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 17:45:56,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2025-04-13 17:45:57,064 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:57,064 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 17:45:57,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash 2143968442, now seen corresponding path program 26 times [2025-04-13 17:45:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:57,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801173817] [2025-04-13 17:45:57,065 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:57,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:57,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:45:57,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:57,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:57,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:57,403 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 17:45:57,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:57,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801173817] [2025-04-13 17:45:57,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801173817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:57,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996464699] [2025-04-13 17:45:57,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:45:57,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:57,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:57,405 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 17:45:57,405 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 17:45:57,539 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 17:45:57,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 17:45:57,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:45:57,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:57,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:45:57,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:57,684 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 17:45:57,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:57,816 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 17:45:57,816 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 171 [2025-04-13 17:45:57,969 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 17:45:57,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996464699] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:57,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:57,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 7] total 24 [2025-04-13 17:45:57,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062481660] [2025-04-13 17:45:57,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:57,970 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:45:57,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:57,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:45:57,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:45:57,970 INFO L87 Difference]: Start difference. First operand 146 states and 399 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:45:58,714 INFO L93 Difference]: Finished difference Result 253 states and 604 transitions. [2025-04-13 17:45:58,714 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:45:58,714 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 17:45:58,714 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:45:58,715 INFO L225 Difference]: With dead ends: 253 [2025-04-13 17:45:58,715 INFO L226 Difference]: Without dead ends: 245 [2025-04-13 17:45:58,716 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=319, Invalid=1487, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:45:58,716 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:45:58,716 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:45:58,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-04-13 17:45:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 146. [2025-04-13 17:45:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 2.7379310344827585) internal successors, (397), 145 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 397 transitions. [2025-04-13 17:45:58,811 INFO L79 Accepts]: Start accepts. Automaton has 146 states and 397 transitions. Word has length 27 [2025-04-13 17:45:58,811 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:45:58,811 INFO L485 AbstractCegarLoop]: Abstraction has 146 states and 397 transitions. [2025-04-13 17:45:58,811 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:45:58,811 INFO L278 IsEmpty]: Start isEmpty. Operand 146 states and 397 transitions. [2025-04-13 17:45:58,812 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 17:45:58,812 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:45:58,812 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 17:45:58,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-04-13 17:45:59,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 17:45:59,012 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 17:45:59,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:45:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash -898699156, now seen corresponding path program 27 times [2025-04-13 17:45:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:45:59,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208891979] [2025-04-13 17:45:59,013 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:45:59,021 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 17:45:59,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 17:45:59,031 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:59,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:59,243 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 17:45:59,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:45:59,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208891979] [2025-04-13 17:45:59,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208891979] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:45:59,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874038944] [2025-04-13 17:45:59,243 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:45:59,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:45:59,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:45:59,245 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 17:45:59,247 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 17:45:59,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 4 equivalence classes. [2025-04-13 17:45:59,404 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 21 of 27 statements. [2025-04-13 17:45:59,404 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:45:59,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:45:59,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 17:45:59,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:45:59,512 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 17:45:59,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:45:59,671 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 17:45:59,671 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 17:45:59,770 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 17:45:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874038944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:45:59,770 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:45:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 7] total 19 [2025-04-13 17:45:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729639471] [2025-04-13 17:45:59,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:45:59,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:45:59,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:45:59,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:45:59,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:45:59,771 INFO L87 Difference]: Start difference. First operand 146 states and 397 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:00,412 INFO L93 Difference]: Finished difference Result 238 states and 601 transitions. [2025-04-13 17:46:00,412 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 17:46:00,413 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-04-13 17:46:00,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:00,414 INFO L225 Difference]: With dead ends: 238 [2025-04-13 17:46:00,414 INFO L226 Difference]: Without dead ends: 227 [2025-04-13 17:46:00,414 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:46:00,414 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:00,415 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 0 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:46:00,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-04-13 17:46:00,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 150. [2025-04-13 17:46:00,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 149 states have (on average 2.771812080536913) internal successors, (413), 149 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:00,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 413 transitions. [2025-04-13 17:46:00,520 INFO L79 Accepts]: Start accepts. Automaton has 150 states and 413 transitions. Word has length 27 [2025-04-13 17:46:00,520 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:00,520 INFO L485 AbstractCegarLoop]: Abstraction has 150 states and 413 transitions. [2025-04-13 17:46:00,520 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:00,520 INFO L278 IsEmpty]: Start isEmpty. Operand 150 states and 413 transitions. [2025-04-13 17:46:00,520 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:00,520 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:00,520 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:00,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:00,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:00,721 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 17:46:00,721 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:00,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1384390801, now seen corresponding path program 28 times [2025-04-13 17:46:00,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:00,721 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055351859] [2025-04-13 17:46:00,721 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:00,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:00,730 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:00,733 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:46:00,733 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:46:00,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:00,921 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 17:46:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:00,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055351859] [2025-04-13 17:46:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055351859] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:00,922 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948044391] [2025-04-13 17:46:00,922 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:00,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:00,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:00,924 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 17:46:00,924 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 17:46:01,059 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:01,067 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:46:01,067 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:46:01,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:01,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:46:01,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:01,205 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:46:01,205 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:46:01,225 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 17:46:01,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:01,430 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:01,431 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 184 [2025-04-13 17:46:01,741 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 17:46:01,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948044391] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:01,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:01,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-13 17:46:01,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212569803] [2025-04-13 17:46:01,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:01,742 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:46:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:01,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:46:01,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:46:01,742 INFO L87 Difference]: Start difference. First operand 150 states and 413 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 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 17:46:02,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:02,621 INFO L93 Difference]: Finished difference Result 231 states and 601 transitions. [2025-04-13 17:46:02,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:46:02,621 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:02,621 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:02,623 INFO L225 Difference]: With dead ends: 231 [2025-04-13 17:46:02,623 INFO L226 Difference]: Without dead ends: 205 [2025-04-13 17:46:02,623 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:46:02,623 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:02,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:46:02,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-04-13 17:46:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 154. [2025-04-13 17:46:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 153 states have (on average 2.758169934640523) internal successors, (422), 153 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 422 transitions. [2025-04-13 17:46:02,738 INFO L79 Accepts]: Start accepts. Automaton has 154 states and 422 transitions. Word has length 28 [2025-04-13 17:46:02,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:02,738 INFO L485 AbstractCegarLoop]: Abstraction has 154 states and 422 transitions. [2025-04-13 17:46:02,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 19 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 17:46:02,738 INFO L278 IsEmpty]: Start isEmpty. Operand 154 states and 422 transitions. [2025-04-13 17:46:02,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:02,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:02,738 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 17:46:02,746 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 17:46:02,938 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-04-13 17:46:02,939 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 17:46:02,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:02,939 INFO L85 PathProgramCache]: Analyzing trace with hash -185934453, now seen corresponding path program 29 times [2025-04-13 17:46:02,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:02,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014672817] [2025-04-13 17:46:02,939 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:02,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:02,948 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:02,969 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:02,969 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:02,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:03,837 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:46:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:03,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014672817] [2025-04-13 17:46:03,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014672817] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:03,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518471213] [2025-04-13 17:46:03,837 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:03,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:03,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:03,839 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 17:46:03,844 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 17:46:04,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:04,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:04,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:04,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:04,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:46:04,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:04,400 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:46:04,400 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:46:04,429 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 17:46:04,429 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:04,634 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:04,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 195 treesize of output 193 [2025-04-13 17:46:05,094 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 17:46:05,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518471213] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:05,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:05,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13, 9] total 37 [2025-04-13 17:46:05,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550922240] [2025-04-13 17:46:05,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:05,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 17:46:05,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:05,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 17:46:05,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1291, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:46:05,095 INFO L87 Difference]: Start difference. First operand 154 states and 422 transitions. Second operand has 38 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 38 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 17:46:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:06,318 INFO L93 Difference]: Finished difference Result 232 states and 605 transitions. [2025-04-13 17:46:06,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:46:06,319 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 38 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 28 [2025-04-13 17:46:06,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:06,320 INFO L225 Difference]: With dead ends: 232 [2025-04-13 17:46:06,320 INFO L226 Difference]: Without dead ends: 211 [2025-04-13 17:46:06,320 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=322, Invalid=3100, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:46:06,320 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:06,320 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 0 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:46:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-04-13 17:46:06,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 156. [2025-04-13 17:46:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 2.7548387096774194) internal successors, (427), 155 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:06,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 427 transitions. [2025-04-13 17:46:06,423 INFO L79 Accepts]: Start accepts. Automaton has 156 states and 427 transitions. Word has length 28 [2025-04-13 17:46:06,423 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:06,423 INFO L485 AbstractCegarLoop]: Abstraction has 156 states and 427 transitions. [2025-04-13 17:46:06,424 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 38 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 17:46:06,424 INFO L278 IsEmpty]: Start isEmpty. Operand 156 states and 427 transitions. [2025-04-13 17:46:06,424 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:06,424 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:06,424 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:46:06,432 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 17:46:06,624 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 17:46:06,625 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 17:46:06,625 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:06,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1365580827, now seen corresponding path program 30 times [2025-04-13 17:46:06,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:06,625 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260330260] [2025-04-13 17:46:06,625 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:46:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:06,635 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:06,645 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 17:46:06,646 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:46:06,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:07,058 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 17:46:07,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:07,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260330260] [2025-04-13 17:46:07,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260330260] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:07,058 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885914791] [2025-04-13 17:46:07,058 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:46:07,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:07,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:07,060 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 17:46:07,061 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 17:46:07,207 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:07,227 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 17:46:07,227 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:46:07,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:07,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 17:46:07,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:07,545 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:46:07,545 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:46:07,566 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 17:46:07,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:08,143 INFO L325 Elim1Store]: treesize reduction 11, result has 93.1 percent of original size [2025-04-13 17:46:08,144 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 156 treesize of output 216 [2025-04-13 17:46:09,234 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 17:46:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885914791] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:09,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 17:46:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442311151] [2025-04-13 17:46:09,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:09,235 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:46:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:09,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:46:09,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=803, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:46:09,235 INFO L87 Difference]: Start difference. First operand 156 states and 427 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:12,464 INFO L93 Difference]: Finished difference Result 336 states and 828 transitions. [2025-04-13 17:46:12,466 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 17:46:12,466 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:12,466 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:12,467 INFO L225 Difference]: With dead ends: 336 [2025-04-13 17:46:12,467 INFO L226 Difference]: Without dead ends: 306 [2025-04-13 17:46:12,468 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1310 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=627, Invalid=3929, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:46:12,468 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:12,468 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:46:12,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2025-04-13 17:46:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 172. [2025-04-13 17:46:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.818713450292398) internal successors, (482), 171 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 482 transitions. [2025-04-13 17:46:12,600 INFO L79 Accepts]: Start accepts. Automaton has 172 states and 482 transitions. Word has length 28 [2025-04-13 17:46:12,600 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:12,600 INFO L485 AbstractCegarLoop]: Abstraction has 172 states and 482 transitions. [2025-04-13 17:46:12,601 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:12,601 INFO L278 IsEmpty]: Start isEmpty. Operand 172 states and 482 transitions. [2025-04-13 17:46:12,601 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:12,601 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:12,601 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 17:46:12,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:12,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 17:46:12,802 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 17:46:12,802 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:12,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1415629707, now seen corresponding path program 31 times [2025-04-13 17:46:12,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:12,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265773180] [2025-04-13 17:46:12,802 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:46:12,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:12,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:46:12,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:12,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:12,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:13,370 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 17:46:13,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:13,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265773180] [2025-04-13 17:46:13,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265773180] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:13,371 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796830909] [2025-04-13 17:46:13,371 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:46:13,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:13,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:13,372 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 17:46:13,373 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 17:46:13,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:46:13,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:13,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:13,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:13,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:46:13,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:13,733 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:46:13,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:46:13,757 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 17:46:13,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:13,898 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:13,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 210 treesize of output 206 [2025-04-13 17:46:14,551 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 17:46:14,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796830909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:14,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:14,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 17:46:14,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708771240] [2025-04-13 17:46:14,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:14,551 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:46:14,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:14,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:46:14,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:46:14,552 INFO L87 Difference]: Start difference. First operand 172 states and 482 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:16,849 INFO L93 Difference]: Finished difference Result 381 states and 935 transitions. [2025-04-13 17:46:16,849 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 17:46:16,849 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:16,849 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:16,851 INFO L225 Difference]: With dead ends: 381 [2025-04-13 17:46:16,851 INFO L226 Difference]: Without dead ends: 353 [2025-04-13 17:46:16,851 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=790, Invalid=6692, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 17:46:16,851 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 302 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:16,852 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 0 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:46:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-04-13 17:46:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2025-04-13 17:46:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.900523560209424) internal successors, (554), 191 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 554 transitions. [2025-04-13 17:46:17,008 INFO L79 Accepts]: Start accepts. Automaton has 192 states and 554 transitions. Word has length 28 [2025-04-13 17:46:17,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:17,008 INFO L485 AbstractCegarLoop]: Abstraction has 192 states and 554 transitions. [2025-04-13 17:46:17,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:17,008 INFO L278 IsEmpty]: Start isEmpty. Operand 192 states and 554 transitions. [2025-04-13 17:46:17,009 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:17,009 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:17,009 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 17:46:17,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2025-04-13 17:46:17,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 17:46:17,210 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 17:46:17,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:17,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1418166747, now seen corresponding path program 32 times [2025-04-13 17:46:17,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:17,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450023070] [2025-04-13 17:46:17,210 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:17,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:17,218 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:17,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:17,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:17,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:17,680 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 17:46:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:17,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450023070] [2025-04-13 17:46:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450023070] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:17,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821206840] [2025-04-13 17:46:17,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:17,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:17,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:17,682 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 17:46:17,683 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 17:46:17,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:17,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:17,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:17,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:17,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:46:17,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:18,087 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:46:18,087 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:46:18,116 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 17:46:18,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:18,233 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:18,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:46:18,797 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 17:46:18,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821206840] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:18,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:18,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 17:46:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318938468] [2025-04-13 17:46:18,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:18,798 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:46:18,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:18,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:46:18,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:46:18,799 INFO L87 Difference]: Start difference. First operand 192 states and 554 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:20,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:20,531 INFO L93 Difference]: Finished difference Result 358 states and 883 transitions. [2025-04-13 17:46:20,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:46:20,531 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:20,531 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:20,533 INFO L225 Difference]: With dead ends: 358 [2025-04-13 17:46:20,533 INFO L226 Difference]: Without dead ends: 328 [2025-04-13 17:46:20,534 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1344 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=517, Invalid=4453, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 17:46:20,534 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:20,534 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:46:20,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-04-13 17:46:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 192. [2025-04-13 17:46:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 2.869109947643979) internal successors, (548), 191 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:20,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 548 transitions. [2025-04-13 17:46:20,702 INFO L79 Accepts]: Start accepts. Automaton has 192 states and 548 transitions. Word has length 28 [2025-04-13 17:46:20,702 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:20,702 INFO L485 AbstractCegarLoop]: Abstraction has 192 states and 548 transitions. [2025-04-13 17:46:20,703 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:20,703 INFO L278 IsEmpty]: Start isEmpty. Operand 192 states and 548 transitions. [2025-04-13 17:46:20,703 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:20,703 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:20,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 17:46:20,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2025-04-13 17:46:20,903 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:20,904 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 17:46:20,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:20,904 INFO L85 PathProgramCache]: Analyzing trace with hash 826007813, now seen corresponding path program 33 times [2025-04-13 17:46:20,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:20,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527165161] [2025-04-13 17:46:20,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:20,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:20,913 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:20,922 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 17:46:20,923 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:46:20,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:21,275 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 17:46:21,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:21,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527165161] [2025-04-13 17:46:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527165161] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:21,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596557961] [2025-04-13 17:46:21,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:21,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:21,277 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 17:46:21,278 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 17:46:21,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:21,456 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 17:46:21,456 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:46:21,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:21,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:46:21,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:21,821 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:46:21,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:46:21,849 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 17:46:21,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:22,572 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 17:46:22,572 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 245 [2025-04-13 17:46:24,722 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 17:46:24,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596557961] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:24,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:24,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 17:46:24,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825838220] [2025-04-13 17:46:24,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:24,723 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:46:24,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:24,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:46:24,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:46:24,723 INFO L87 Difference]: Start difference. First operand 192 states and 548 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:27,864 INFO L93 Difference]: Finished difference Result 323 states and 870 transitions. [2025-04-13 17:46:27,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 17:46:27,864 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:27,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:27,866 INFO L225 Difference]: With dead ends: 323 [2025-04-13 17:46:27,866 INFO L226 Difference]: Without dead ends: 294 [2025-04-13 17:46:27,866 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=634, Invalid=4196, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 17:46:27,866 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:27,866 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:46:27,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2025-04-13 17:46:28,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 205. [2025-04-13 17:46:28,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 204 states have (on average 2.8627450980392157) internal successors, (584), 204 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:28,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 584 transitions. [2025-04-13 17:46:28,048 INFO L79 Accepts]: Start accepts. Automaton has 205 states and 584 transitions. Word has length 28 [2025-04-13 17:46:28,048 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:28,048 INFO L485 AbstractCegarLoop]: Abstraction has 205 states and 584 transitions. [2025-04-13 17:46:28,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:28,048 INFO L278 IsEmpty]: Start isEmpty. Operand 205 states and 584 transitions. [2025-04-13 17:46:28,049 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:28,049 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:28,049 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 17:46:28,056 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 17:46:28,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:28,249 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 17:46:28,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:28,250 INFO L85 PathProgramCache]: Analyzing trace with hash 648475759, now seen corresponding path program 34 times [2025-04-13 17:46:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:28,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075686110] [2025-04-13 17:46:28,250 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:28,259 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:28,262 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:46:28,263 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:46:28,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:28,469 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 17:46:28,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:28,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075686110] [2025-04-13 17:46:28,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075686110] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:28,469 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616050536] [2025-04-13 17:46:28,469 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:28,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:28,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:28,471 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 17:46:28,473 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 17:46:28,635 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:28,643 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:46:28,643 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:46:28,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:28,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:46:28,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:28,771 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:46:28,771 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:46:28,791 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 17:46:28,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:28,936 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:28,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:46:29,373 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 17:46:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616050536] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:29,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:29,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 17:46:29,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920576566] [2025-04-13 17:46:29,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:29,374 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:46:29,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:29,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:46:29,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:46:29,375 INFO L87 Difference]: Start difference. First operand 205 states and 584 transitions. Second operand has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:30,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:30,359 INFO L93 Difference]: Finished difference Result 271 states and 742 transitions. [2025-04-13 17:46:30,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:46:30,359 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:30,359 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:30,360 INFO L225 Difference]: With dead ends: 271 [2025-04-13 17:46:30,360 INFO L226 Difference]: Without dead ends: 243 [2025-04-13 17:46:30,361 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:46:30,361 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:30,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:46:30,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-04-13 17:46:30,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 207. [2025-04-13 17:46:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 2.849514563106796) internal successors, (587), 206 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 17:46:30,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 587 transitions. [2025-04-13 17:46:30,552 INFO L79 Accepts]: Start accepts. Automaton has 207 states and 587 transitions. Word has length 28 [2025-04-13 17:46:30,552 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:30,552 INFO L485 AbstractCegarLoop]: Abstraction has 207 states and 587 transitions. [2025-04-13 17:46:30,552 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.8) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:30,552 INFO L278 IsEmpty]: Start isEmpty. Operand 207 states and 587 transitions. [2025-04-13 17:46:30,552 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:30,552 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:30,552 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 17:46:30,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:30,753 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-04-13 17:46:30,753 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 17:46:30,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:30,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1019819067, now seen corresponding path program 35 times [2025-04-13 17:46:30,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:30,753 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142960421] [2025-04-13 17:46:30,753 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:30,762 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:30,777 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:30,777 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:30,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:31,371 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:46:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:31,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142960421] [2025-04-13 17:46:31,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142960421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:31,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349719392] [2025-04-13 17:46:31,372 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:31,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:31,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:31,373 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 17:46:31,374 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 17:46:31,535 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:31,584 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:31,585 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:31,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:31,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:46:31,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:31,850 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:46:31,851 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:46:31,887 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 17:46:31,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:32,114 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:32,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 17:46:32,718 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 17:46:32,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349719392] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:32,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:32,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 9] total 33 [2025-04-13 17:46:32,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543844821] [2025-04-13 17:46:32,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:32,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:46:32,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:32,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:46:32,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:46:32,720 INFO L87 Difference]: Start difference. First operand 207 states and 587 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 17:46:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:34,362 INFO L93 Difference]: Finished difference Result 341 states and 869 transitions. [2025-04-13 17:46:34,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 17:46:34,362 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 28 [2025-04-13 17:46:34,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:34,364 INFO L225 Difference]: With dead ends: 341 [2025-04-13 17:46:34,364 INFO L226 Difference]: Without dead ends: 315 [2025-04-13 17:46:34,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=449, Invalid=3973, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:46:34,364 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:34,364 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:46:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-04-13 17:46:34,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 223. [2025-04-13 17:46:34,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 222 states have (on average 2.9234234234234235) internal successors, (649), 222 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:34,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 649 transitions. [2025-04-13 17:46:34,577 INFO L79 Accepts]: Start accepts. Automaton has 223 states and 649 transitions. Word has length 28 [2025-04-13 17:46:34,577 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:34,577 INFO L485 AbstractCegarLoop]: Abstraction has 223 states and 649 transitions. [2025-04-13 17:46:34,577 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 17:46:34,577 INFO L278 IsEmpty]: Start isEmpty. Operand 223 states and 649 transitions. [2025-04-13 17:46:34,577 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:34,577 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:34,577 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 17:46:34,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2025-04-13 17:46:34,778 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:34,778 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 17:46:34,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:34,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1017282027, now seen corresponding path program 36 times [2025-04-13 17:46:34,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:34,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243090083] [2025-04-13 17:46:34,778 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:46:34,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:34,787 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:34,803 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:34,804 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:46:34,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:35,247 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 17:46:35,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:35,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243090083] [2025-04-13 17:46:35,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243090083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:35,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557603729] [2025-04-13 17:46:35,248 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:46:35,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:35,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:35,250 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 17:46:35,251 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 17:46:35,419 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:35,447 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:35,448 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:46:35,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:35,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 17:46:35,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:35,687 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:46:35,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 75 treesize of output 47 [2025-04-13 17:46:35,714 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 17:46:35,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:35,848 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:35,849 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:46:36,696 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 17:46:36,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557603729] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:36,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:36,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 31 [2025-04-13 17:46:36,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271509549] [2025-04-13 17:46:36,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:36,697 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:46:36,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:36,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:46:36,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=885, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:46:36,697 INFO L87 Difference]: Start difference. First operand 223 states and 649 transitions. Second operand has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 32 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 17:46:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:38,470 INFO L93 Difference]: Finished difference Result 358 states and 884 transitions. [2025-04-13 17:46:38,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 17:46:38,470 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 32 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 28 [2025-04-13 17:46:38,470 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:38,471 INFO L225 Difference]: With dead ends: 358 [2025-04-13 17:46:38,471 INFO L226 Difference]: Without dead ends: 324 [2025-04-13 17:46:38,472 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=505, Invalid=4465, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 17:46:38,472 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:38,472 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:46:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-04-13 17:46:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 219. [2025-04-13 17:46:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 2.876146788990826) internal successors, (627), 218 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 627 transitions. [2025-04-13 17:46:38,680 INFO L79 Accepts]: Start accepts. Automaton has 219 states and 627 transitions. Word has length 28 [2025-04-13 17:46:38,680 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:38,680 INFO L485 AbstractCegarLoop]: Abstraction has 219 states and 627 transitions. [2025-04-13 17:46:38,680 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.935483870967742) internal successors, (60), 32 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 17:46:38,680 INFO L278 IsEmpty]: Start isEmpty. Operand 219 states and 627 transitions. [2025-04-13 17:46:38,681 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:38,681 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:38,681 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 17:46:38,688 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 17:46:38,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2025-04-13 17:46:38,881 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 17:46:38,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:38,882 INFO L85 PathProgramCache]: Analyzing trace with hash -906459507, now seen corresponding path program 37 times [2025-04-13 17:46:38,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:38,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720205281] [2025-04-13 17:46:38,882 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:46:38,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:38,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:46:38,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:38,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:38,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:39,447 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 17:46:39,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:39,447 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720205281] [2025-04-13 17:46:39,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720205281] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:39,448 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201825159] [2025-04-13 17:46:39,448 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:46:39,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:39,449 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 17:46:39,450 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 17:46:39,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:46:39,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:39,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:46:39,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:39,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:46:39,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:39,823 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:46:39,824 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:46:39,849 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 17:46:39,849 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:40,020 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:40,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 228 [2025-04-13 17:46:40,634 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:46:40,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201825159] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:40,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 17:46:40,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80335735] [2025-04-13 17:46:40,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:40,635 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:46:40,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:40,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:46:40,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:46:40,635 INFO L87 Difference]: Start difference. First operand 219 states and 627 transitions. Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:42,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:42,735 INFO L93 Difference]: Finished difference Result 332 states and 861 transitions. [2025-04-13 17:46:42,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 17:46:42,735 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:42,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:42,736 INFO L225 Difference]: With dead ends: 332 [2025-04-13 17:46:42,736 INFO L226 Difference]: Without dead ends: 302 [2025-04-13 17:46:42,737 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1515 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=684, Invalid=5478, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 17:46:42,737 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:42,737 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:46:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-04-13 17:46:42,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 225. [2025-04-13 17:46:42,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 2.8839285714285716) internal successors, (646), 224 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:42,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 646 transitions. [2025-04-13 17:46:42,960 INFO L79 Accepts]: Start accepts. Automaton has 225 states and 646 transitions. Word has length 28 [2025-04-13 17:46:42,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:42,960 INFO L485 AbstractCegarLoop]: Abstraction has 225 states and 646 transitions. [2025-04-13 17:46:42,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:42,960 INFO L278 IsEmpty]: Start isEmpty. Operand 225 states and 646 transitions. [2025-04-13 17:46:42,960 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:42,960 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:42,960 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 17:46:42,967 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 17:46:43,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:43,161 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 17:46:43,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash 2131446987, now seen corresponding path program 38 times [2025-04-13 17:46:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:43,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569666729] [2025-04-13 17:46:43,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:43,170 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:43,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:43,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:43,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:43,610 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 17:46:43,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:43,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569666729] [2025-04-13 17:46:43,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569666729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:43,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458254189] [2025-04-13 17:46:43,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:46:43,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:43,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:43,613 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 17:46:43,613 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 17:46:43,782 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:43,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:43,806 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:46:43,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:43,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 17:46:43,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:44,076 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:46:44,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:46:44,099 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 17:46:44,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:44,478 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:46:44,479 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 233 [2025-04-13 17:46:47,263 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 17:46:47,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458254189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:47,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:47,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-04-13 17:46:47,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907946463] [2025-04-13 17:46:47,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:47,264 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:46:47,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:47,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:46:47,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:46:47,265 INFO L87 Difference]: Start difference. First operand 225 states and 646 transitions. Second operand has 28 states, 27 states have (on average 1.8518518518518519) 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 17:46:49,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:49,446 INFO L93 Difference]: Finished difference Result 310 states and 822 transitions. [2025-04-13 17:46:49,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 17:46:49,446 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.8518518518518519) 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 28 [2025-04-13 17:46:49,446 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:49,447 INFO L225 Difference]: With dead ends: 310 [2025-04-13 17:46:49,447 INFO L226 Difference]: Without dead ends: 285 [2025-04-13 17:46:49,448 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=408, Invalid=3014, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:46:49,448 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:49,448 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:46:49,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-04-13 17:46:49,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 235. [2025-04-13 17:46:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 234 states have (on average 2.8675213675213675) internal successors, (671), 234 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 17:46:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 671 transitions. [2025-04-13 17:46:49,711 INFO L79 Accepts]: Start accepts. Automaton has 235 states and 671 transitions. Word has length 28 [2025-04-13 17:46:49,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:49,711 INFO L485 AbstractCegarLoop]: Abstraction has 235 states and 671 transitions. [2025-04-13 17:46:49,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.8518518518518519) 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 17:46:49,711 INFO L278 IsEmpty]: Start isEmpty. Operand 235 states and 671 transitions. [2025-04-13 17:46:49,711 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:49,711 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:49,711 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 17:46:49,718 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 17:46:49,912 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:49,912 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 17:46:49,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:49,912 INFO L85 PathProgramCache]: Analyzing trace with hash -612005029, now seen corresponding path program 39 times [2025-04-13 17:46:49,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:49,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412092493] [2025-04-13 17:46:49,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:49,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:49,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:49,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 17:46:49,935 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:46:49,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:50,362 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 17:46:50,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:50,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412092493] [2025-04-13 17:46:50,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412092493] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:50,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434135557] [2025-04-13 17:46:50,363 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:46:50,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:50,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:50,366 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 17:46:50,368 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 17:46:50,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:50,577 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 17:46:50,577 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:46:50,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:50,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:46:50,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:50,757 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:46:50,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:46:50,776 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 17:46:50,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:51,078 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:46:51,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 233 [2025-04-13 17:46:52,432 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 17:46:52,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434135557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:52,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 17:46:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569617064] [2025-04-13 17:46:52,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:52,433 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:46:52,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:52,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:46:52,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:46:52,434 INFO L87 Difference]: Start difference. First operand 235 states and 671 transitions. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:54,505 INFO L93 Difference]: Finished difference Result 358 states and 949 transitions. [2025-04-13 17:46:54,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 17:46:54,506 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:54,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:54,507 INFO L225 Difference]: With dead ends: 358 [2025-04-13 17:46:54,507 INFO L226 Difference]: Without dead ends: 332 [2025-04-13 17:46:54,508 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2025-04-13 17:46:54,508 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:54,508 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 0 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:46:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-04-13 17:46:54,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 244. [2025-04-13 17:46:54,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 2.921810699588477) internal successors, (710), 243 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 17:46:54,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 710 transitions. [2025-04-13 17:46:54,773 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 710 transitions. Word has length 28 [2025-04-13 17:46:54,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:54,773 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 710 transitions. [2025-04-13 17:46:54,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:54,773 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 710 transitions. [2025-04-13 17:46:54,774 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:54,774 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:54,774 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 17:46:54,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:54,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2025-04-13 17:46:54,974 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 17:46:54,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:54,975 INFO L85 PathProgramCache]: Analyzing trace with hash -106944869, now seen corresponding path program 40 times [2025-04-13 17:46:54,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:54,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627581744] [2025-04-13 17:46:54,975 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:54,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:54,985 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:54,989 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:46:54,989 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:46:54,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:55,174 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 17:46:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:55,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627581744] [2025-04-13 17:46:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627581744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:55,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535702126] [2025-04-13 17:46:55,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:46:55,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:55,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:55,176 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 17:46:55,178 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 17:46:55,354 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:46:55,363 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:46:55,363 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:46:55,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:55,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:46:55,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:55,506 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:46:55,507 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:46:55,528 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 17:46:55,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:55,685 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:55,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 199 treesize of output 197 [2025-04-13 17:46:56,199 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 17:46:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535702126] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:56,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:56,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 17:46:56,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129644240] [2025-04-13 17:46:56,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:56,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:46:56,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:56,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:46:56,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:46:56,200 INFO L87 Difference]: Start difference. First operand 244 states and 710 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:57,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:46:57,520 INFO L93 Difference]: Finished difference Result 332 states and 919 transitions. [2025-04-13 17:46:57,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:46:57,521 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:46:57,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:46:57,522 INFO L225 Difference]: With dead ends: 332 [2025-04-13 17:46:57,522 INFO L226 Difference]: Without dead ends: 307 [2025-04-13 17:46:57,523 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=1830, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:46:57,523 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:46:57,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:46:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2025-04-13 17:46:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 254. [2025-04-13 17:46:57,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 2.9288537549407114) internal successors, (741), 253 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:57,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 741 transitions. [2025-04-13 17:46:57,797 INFO L79 Accepts]: Start accepts. Automaton has 254 states and 741 transitions. Word has length 28 [2025-04-13 17:46:57,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:46:57,798 INFO L485 AbstractCegarLoop]: Abstraction has 254 states and 741 transitions. [2025-04-13 17:46:57,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 23 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:46:57,798 INFO L278 IsEmpty]: Start isEmpty. Operand 254 states and 741 transitions. [2025-04-13 17:46:57,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:46:57,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:46:57,798 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 17:46:57,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2025-04-13 17:46:57,998 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 17:46:57,999 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 17:46:57,999 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:46:57,999 INFO L85 PathProgramCache]: Analyzing trace with hash 790680267, now seen corresponding path program 41 times [2025-04-13 17:46:57,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:46:57,999 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857510002] [2025-04-13 17:46:57,999 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:57,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:46:58,009 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:58,025 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:58,025 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:58,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:58,552 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 17:46:58,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:46:58,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857510002] [2025-04-13 17:46:58,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857510002] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:46:58,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455140809] [2025-04-13 17:46:58,552 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:46:58,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:46:58,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:46:58,554 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 17:46:58,554 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 17:46:58,736 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:46:58,778 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:46:58,778 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:46:58,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:46:58,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:46:58,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:46:58,984 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:46:58,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:46:59,008 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 17:46:59,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:46:59,123 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:46:59,123 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 17:46:59,706 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 17:46:59,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455140809] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:46:59,707 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:46:59,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 32 [2025-04-13 17:46:59,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798232258] [2025-04-13 17:46:59,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:46:59,707 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:46:59,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:46:59,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:46:59,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=947, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:46:59,708 INFO L87 Difference]: Start difference. First operand 254 states and 741 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 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 17:47:01,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:01,430 INFO L93 Difference]: Finished difference Result 373 states and 984 transitions. [2025-04-13 17:47:01,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 17:47:01,430 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 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 28 [2025-04-13 17:47:01,430 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:01,432 INFO L225 Difference]: With dead ends: 373 [2025-04-13 17:47:01,432 INFO L226 Difference]: Without dead ends: 348 [2025-04-13 17:47:01,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=486, Invalid=4484, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 17:47:01,432 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:01,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:47:01,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-04-13 17:47:01,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 272. [2025-04-13 17:47:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 2.996309963099631) internal successors, (812), 271 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:01,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 812 transitions. [2025-04-13 17:47:01,738 INFO L79 Accepts]: Start accepts. Automaton has 272 states and 812 transitions. Word has length 28 [2025-04-13 17:47:01,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:01,738 INFO L485 AbstractCegarLoop]: Abstraction has 272 states and 812 transitions. [2025-04-13 17:47:01,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 33 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 17:47:01,739 INFO L278 IsEmpty]: Start isEmpty. Operand 272 states and 812 transitions. [2025-04-13 17:47:01,739 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:01,739 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:01,739 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 17:47:01,747 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 17:47:01,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 17:47:01,940 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 17:47:01,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:01,940 INFO L85 PathProgramCache]: Analyzing trace with hash 793217307, now seen corresponding path program 42 times [2025-04-13 17:47:01,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:01,940 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793075496] [2025-04-13 17:47:01,940 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:47:01,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:01,949 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:01,965 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:01,965 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:47:01,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:02,350 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 17:47:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:02,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793075496] [2025-04-13 17:47:02,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793075496] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:02,350 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476355] [2025-04-13 17:47:02,350 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:47:02,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:02,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:02,352 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 17:47:02,353 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 17:47:02,538 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:02,565 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:02,565 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:47:02,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:02,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 17:47:02,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:02,858 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:47:02,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:47:02,883 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 17:47:02,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:03,420 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:47:03,420 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 247 [2025-04-13 17:47:05,762 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 17:47:05,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476355] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:05,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:05,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 17:47:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015235525] [2025-04-13 17:47:05,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:05,763 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:47:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:05,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:47:05,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:47:05,763 INFO L87 Difference]: Start difference. First operand 272 states and 812 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:09,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:09,736 INFO L93 Difference]: Finished difference Result 440 states and 1136 transitions. [2025-04-13 17:47:09,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 17:47:09,736 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:47:09,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:09,738 INFO L225 Difference]: With dead ends: 440 [2025-04-13 17:47:09,738 INFO L226 Difference]: Without dead ends: 402 [2025-04-13 17:47:09,739 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2404 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=876, Invalid=6096, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 17:47:09,739 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:09,739 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:47:09,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-04-13 17:47:10,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 284. [2025-04-13 17:47:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.010600706713781) internal successors, (852), 283 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 17:47:10,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 852 transitions. [2025-04-13 17:47:10,100 INFO L79 Accepts]: Start accepts. Automaton has 284 states and 852 transitions. Word has length 28 [2025-04-13 17:47:10,100 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:10,100 INFO L485 AbstractCegarLoop]: Abstraction has 284 states and 852 transitions. [2025-04-13 17:47:10,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:10,100 INFO L278 IsEmpty]: Start isEmpty. Operand 284 states and 852 transitions. [2025-04-13 17:47:10,100 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:10,100 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:10,100 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 17:47:10,108 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 17:47:10,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:10,301 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 17:47:10,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 904039827, now seen corresponding path program 43 times [2025-04-13 17:47:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:10,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419640738] [2025-04-13 17:47:10,302 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:47:10,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:10,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:47:10,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:10,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:47:10,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:10,837 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 17:47:10,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:10,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419640738] [2025-04-13 17:47:10,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419640738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:10,837 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444604841] [2025-04-13 17:47:10,837 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:47:10,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:10,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:10,839 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 17:47:10,840 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 17:47:11,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:47:11,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:11,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:47:11,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:11,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:47:11,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:11,210 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:47:11,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:47:11,237 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 17:47:11,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:11,375 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:47:11,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:47:11,818 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 17:47:11,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444604841] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:11,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:11,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 17:47:11,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114398823] [2025-04-13 17:47:11,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:11,819 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:47:11,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:11,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:47:11,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:47:11,819 INFO L87 Difference]: Start difference. First operand 284 states and 852 transitions. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:14,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:14,062 INFO L93 Difference]: Finished difference Result 405 states and 1119 transitions. [2025-04-13 17:47:14,063 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 17:47:14,063 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:47:14,063 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:14,065 INFO L225 Difference]: With dead ends: 405 [2025-04-13 17:47:14,065 INFO L226 Difference]: Without dead ends: 386 [2025-04-13 17:47:14,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=605, Invalid=4797, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 17:47:14,065 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:14,065 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:47:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-04-13 17:47:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 290. [2025-04-13 17:47:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 289 states have (on average 3.0207612456747404) internal successors, (873), 289 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:14,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 873 transitions. [2025-04-13 17:47:14,415 INFO L79 Accepts]: Start accepts. Automaton has 290 states and 873 transitions. Word has length 28 [2025-04-13 17:47:14,415 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:14,415 INFO L485 AbstractCegarLoop]: Abstraction has 290 states and 873 transitions. [2025-04-13 17:47:14,415 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:14,415 INFO L278 IsEmpty]: Start isEmpty. Operand 290 states and 873 transitions. [2025-04-13 17:47:14,415 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:14,415 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:14,416 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 17:47:14,423 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 17:47:14,616 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable61 [2025-04-13 17:47:14,616 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 17:47:14,616 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:14,616 INFO L85 PathProgramCache]: Analyzing trace with hash 44570651, now seen corresponding path program 44 times [2025-04-13 17:47:14,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:14,616 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504968928] [2025-04-13 17:47:14,617 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:47:14,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:14,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:47:14,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:14,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:47:14,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:15,045 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 17:47:15,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:15,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504968928] [2025-04-13 17:47:15,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504968928] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:15,046 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657788458] [2025-04-13 17:47:15,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:47:15,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:15,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:15,048 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 17:47:15,049 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 17:47:15,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:47:15,261 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:15,261 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:47:15,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:15,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 17:47:15,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:15,595 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:47:15,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:47:15,631 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 17:47:15,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:16,094 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:47:16,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 247 [2025-04-13 17:47:18,455 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 17:47:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657788458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:18,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:18,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 17:47:18,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543597084] [2025-04-13 17:47:18,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:18,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:47:18,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:18,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:47:18,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:47:18,456 INFO L87 Difference]: Start difference. First operand 290 states and 873 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:20,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:20,155 INFO L93 Difference]: Finished difference Result 351 states and 997 transitions. [2025-04-13 17:47:20,155 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:47:20,155 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:47:20,156 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:20,157 INFO L225 Difference]: With dead ends: 351 [2025-04-13 17:47:20,157 INFO L226 Difference]: Without dead ends: 327 [2025-04-13 17:47:20,157 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 996 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=423, Invalid=2999, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:47:20,158 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 127 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:20,158 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 0 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:47:20,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2025-04-13 17:47:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 292. [2025-04-13 17:47:20,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 2.9896907216494846) internal successors, (870), 291 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 870 transitions. [2025-04-13 17:47:20,517 INFO L79 Accepts]: Start accepts. Automaton has 292 states and 870 transitions. Word has length 28 [2025-04-13 17:47:20,517 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:20,517 INFO L485 AbstractCegarLoop]: Abstraction has 292 states and 870 transitions. [2025-04-13 17:47:20,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:20,517 INFO L278 IsEmpty]: Start isEmpty. Operand 292 states and 870 transitions. [2025-04-13 17:47:20,518 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:20,518 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:20,518 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 17:47:20,525 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 17:47:20,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:20,718 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 17:47:20,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash -446501081, now seen corresponding path program 45 times [2025-04-13 17:47:20,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:20,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866718142] [2025-04-13 17:47:20,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:47:20,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:20,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:20,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 17:47:20,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:47:20,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:21,109 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 17:47:21,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:21,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866718142] [2025-04-13 17:47:21,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866718142] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:21,110 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079944463] [2025-04-13 17:47:21,110 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:47:21,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:21,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:21,112 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 17:47:21,112 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 17:47:21,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:21,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 17:47:21,327 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:47:21,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:21,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:47:21,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:21,574 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:47:21,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:47:21,595 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 17:47:21,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:21,795 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:47:21,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:47:22,413 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 17:47:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079944463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:22,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:22,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 28 [2025-04-13 17:47:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751994837] [2025-04-13 17:47:22,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:22,414 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:47:22,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:22,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:47:22,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=697, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:47:22,415 INFO L87 Difference]: Start difference. First operand 292 states and 870 transitions. Second operand has 29 states, 28 states have (on average 1.9285714285714286) 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 17:47:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:24,151 INFO L93 Difference]: Finished difference Result 380 states and 1066 transitions. [2025-04-13 17:47:24,152 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:47:24,152 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9285714285714286) 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 28 [2025-04-13 17:47:24,152 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:24,153 INFO L225 Difference]: With dead ends: 380 [2025-04-13 17:47:24,153 INFO L226 Difference]: Without dead ends: 355 [2025-04-13 17:47:24,154 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=366, Invalid=2286, Unknown=0, NotChecked=0, Total=2652 [2025-04-13 17:47:24,154 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:24,154 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:47:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-04-13 17:47:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 301. [2025-04-13 17:47:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 2.98) internal successors, (894), 300 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 894 transitions. [2025-04-13 17:47:24,528 INFO L79 Accepts]: Start accepts. Automaton has 301 states and 894 transitions. Word has length 28 [2025-04-13 17:47:24,528 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:24,528 INFO L485 AbstractCegarLoop]: Abstraction has 301 states and 894 transitions. [2025-04-13 17:47:24,528 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9285714285714286) 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 17:47:24,528 INFO L278 IsEmpty]: Start isEmpty. Operand 301 states and 894 transitions. [2025-04-13 17:47:24,528 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:24,528 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:24,528 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 17:47:24,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 17:47:24,729 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:24,729 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 17:47:24,729 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:24,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1155063079, now seen corresponding path program 46 times [2025-04-13 17:47:24,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:24,730 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227114215] [2025-04-13 17:47:24,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:47:24,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:24,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:47:24,743 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:47:24,743 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:47:24,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:24,936 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 17:47:24,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:24,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227114215] [2025-04-13 17:47:24,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227114215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:24,936 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223006001] [2025-04-13 17:47:24,936 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:47:24,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:24,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:24,938 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 17:47:24,939 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 17:47:25,137 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:47:25,145 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:47:25,145 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:47:25,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:25,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:47:25,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:25,261 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:47:25,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:47:25,282 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 17:47:25,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:25,396 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:47:25,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 195 treesize of output 191 [2025-04-13 17:47:25,903 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 17:47:25,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223006001] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:25,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:25,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 17:47:25,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379814934] [2025-04-13 17:47:25,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:25,904 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:47:25,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:25,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:47:25,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=390, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:47:25,904 INFO L87 Difference]: Start difference. First operand 301 states and 894 transitions. Second operand has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 22 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 17:47:27,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:27,560 INFO L93 Difference]: Finished difference Result 444 states and 1195 transitions. [2025-04-13 17:47:27,561 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 17:47:27,561 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 22 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:47:27,561 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:27,563 INFO L225 Difference]: With dead ends: 444 [2025-04-13 17:47:27,563 INFO L226 Difference]: Without dead ends: 422 [2025-04-13 17:47:27,563 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=271, Invalid=1799, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 17:47:27,564 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 122 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:27,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 0 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:47:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-04-13 17:47:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 313. [2025-04-13 17:47:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 3.019230769230769) internal successors, (942), 312 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 942 transitions. [2025-04-13 17:47:27,969 INFO L79 Accepts]: Start accepts. Automaton has 313 states and 942 transitions. Word has length 28 [2025-04-13 17:47:27,969 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:27,969 INFO L485 AbstractCegarLoop]: Abstraction has 313 states and 942 transitions. [2025-04-13 17:47:27,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 22 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 17:47:27,969 INFO L278 IsEmpty]: Start isEmpty. Operand 313 states and 942 transitions. [2025-04-13 17:47:27,969 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:27,969 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:27,969 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 17:47:27,976 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 17:47:28,170 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:28,170 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 17:47:28,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1157600119, now seen corresponding path program 47 times [2025-04-13 17:47:28,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:28,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824036772] [2025-04-13 17:47:28,170 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:47:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:28,180 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:28,201 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:28,201 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:47:28,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:28,719 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 17:47:28,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:28,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824036772] [2025-04-13 17:47:28,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824036772] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:28,719 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286212555] [2025-04-13 17:47:28,719 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:47:28,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:28,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:28,721 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 17:47:28,722 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 17:47:28,920 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:28,956 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:28,957 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:47:28,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:28,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:47:28,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:29,103 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:47:29,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:47:29,130 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 17:47:29,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:29,239 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:47:29,239 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:47:29,816 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 17:47:29,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286212555] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:29,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:29,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 28 [2025-04-13 17:47:29,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436989204] [2025-04-13 17:47:29,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:29,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:47:29,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:29,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:47:29,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=720, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:47:29,817 INFO L87 Difference]: Start difference. First operand 313 states and 942 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 17:47:31,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:31,515 INFO L93 Difference]: Finished difference Result 410 states and 1117 transitions. [2025-04-13 17:47:31,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 17:47:31,515 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 28 [2025-04-13 17:47:31,515 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:31,517 INFO L225 Difference]: With dead ends: 410 [2025-04-13 17:47:31,517 INFO L226 Difference]: Without dead ends: 393 [2025-04-13 17:47:31,517 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=357, Invalid=3065, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:47:31,518 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 134 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:31,518 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 0 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:47:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2025-04-13 17:47:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 311. [2025-04-13 17:47:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 310 states have (on average 3.003225806451613) internal successors, (931), 310 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 931 transitions. [2025-04-13 17:47:31,910 INFO L79 Accepts]: Start accepts. Automaton has 311 states and 931 transitions. Word has length 28 [2025-04-13 17:47:31,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:31,910 INFO L485 AbstractCegarLoop]: Abstraction has 311 states and 931 transitions. [2025-04-13 17:47:31,910 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 17:47:31,910 INFO L278 IsEmpty]: Start isEmpty. Operand 311 states and 931 transitions. [2025-04-13 17:47:31,911 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:31,911 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:31,911 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 17:47:31,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2025-04-13 17:47:32,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:32,111 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 17:47:32,111 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:32,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2002639335, now seen corresponding path program 48 times [2025-04-13 17:47:32,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:32,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663979381] [2025-04-13 17:47:32,112 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:47:32,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:32,121 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:32,137 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:32,137 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:47:32,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:32,544 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 17:47:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:32,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663979381] [2025-04-13 17:47:32,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663979381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:32,544 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621561031] [2025-04-13 17:47:32,544 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:47:32,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:32,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:32,546 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 17:47:32,547 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 17:47:32,747 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:32,776 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:32,776 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:47:32,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:32,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:47:32,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:32,984 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:47:32,984 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:47:33,003 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 17:47:33,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:33,439 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:47:33,439 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 233 [2025-04-13 17:47:34,750 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 17:47:34,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621561031] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:34,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:34,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 17:47:34,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383912076] [2025-04-13 17:47:34,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:34,751 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:47:34,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:34,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:47:34,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:47:34,751 INFO L87 Difference]: Start difference. First operand 311 states and 931 transitions. Second operand has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:38,125 INFO L93 Difference]: Finished difference Result 502 states and 1345 transitions. [2025-04-13 17:47:38,126 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 17:47:38,126 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:47:38,126 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:38,127 INFO L225 Difference]: With dead ends: 502 [2025-04-13 17:47:38,128 INFO L226 Difference]: Without dead ends: 472 [2025-04-13 17:47:38,128 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1279 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=631, Invalid=3659, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:47:38,128 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 235 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:38,128 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 0 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:47:38,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-04-13 17:47:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 337. [2025-04-13 17:47:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 3.0714285714285716) internal successors, (1032), 336 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1032 transitions. [2025-04-13 17:47:38,552 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 1032 transitions. Word has length 28 [2025-04-13 17:47:38,553 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:38,553 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 1032 transitions. [2025-04-13 17:47:38,553 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.88) internal successors, (47), 26 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:38,553 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 1032 transitions. [2025-04-13 17:47:38,553 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:38,553 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:38,553 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 17:47:38,562 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 17:47:38,756 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 17:47:38,756 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 17:47:38,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:38,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2005176375, now seen corresponding path program 49 times [2025-04-13 17:47:38,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:38,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405908092] [2025-04-13 17:47:38,756 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:47:38,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:38,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:47:38,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:38,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:47:38,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:39,334 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 17:47:39,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:39,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405908092] [2025-04-13 17:47:39,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405908092] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:39,334 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968428468] [2025-04-13 17:47:39,334 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:47:39,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:39,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:39,336 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 17:47:39,337 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 17:47:39,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:47:39,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:39,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:47:39,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:39,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:47:39,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:39,705 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:47:39,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:47:39,735 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 17:47:39,735 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:39,854 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:47:39,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:47:40,376 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 17:47:40,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968428468] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:40,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:40,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 17:47:40,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885870621] [2025-04-13 17:47:40,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:40,376 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:47:40,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:40,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:47:40,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:47:40,377 INFO L87 Difference]: Start difference. First operand 337 states and 1032 transitions. Second operand has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:42,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:42,526 INFO L93 Difference]: Finished difference Result 456 states and 1254 transitions. [2025-04-13 17:47:42,526 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 17:47:42,527 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:47:42,527 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:42,529 INFO L225 Difference]: With dead ends: 456 [2025-04-13 17:47:42,529 INFO L226 Difference]: Without dead ends: 435 [2025-04-13 17:47:42,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=520, Invalid=4172, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 17:47:42,530 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 190 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1375 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:42,530 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 0 Invalid, 1406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:47:42,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-04-13 17:47:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 341. [2025-04-13 17:47:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.0764705882352943) internal successors, (1046), 340 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:42,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1046 transitions. [2025-04-13 17:47:42,984 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 1046 transitions. Word has length 28 [2025-04-13 17:47:42,984 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:42,984 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 1046 transitions. [2025-04-13 17:47:42,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:42,984 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 1046 transitions. [2025-04-13 17:47:42,984 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:42,984 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:42,985 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 17:47:42,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2025-04-13 17:47:43,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-04-13 17:47:43,185 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 17:47:43,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:43,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2115998895, now seen corresponding path program 50 times [2025-04-13 17:47:43,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:43,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889260992] [2025-04-13 17:47:43,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:47:43,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:43,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:47:43,204 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:43,205 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:47:43,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:43,563 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 17:47:43,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:43,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889260992] [2025-04-13 17:47:43,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889260992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:43,563 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663928307] [2025-04-13 17:47:43,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:47:43,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:43,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:43,565 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 17:47:43,566 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 17:47:43,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:47:43,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:47:43,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:47:43,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:43,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-04-13 17:47:43,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:44,117 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:47:44,117 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:47:44,141 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 17:47:44,141 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:44,595 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:47:44,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 247 [2025-04-13 17:47:46,991 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 17:47:46,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663928307] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:46,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:46,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 17:47:46,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048626313] [2025-04-13 17:47:46,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:46,992 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:47:46,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:46,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:47:46,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:47:46,992 INFO L87 Difference]: Start difference. First operand 341 states and 1046 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:49,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:49,509 INFO L93 Difference]: Finished difference Result 440 states and 1229 transitions. [2025-04-13 17:47:49,509 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:47:49,509 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:47:49,509 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:49,511 INFO L225 Difference]: With dead ends: 440 [2025-04-13 17:47:49,511 INFO L226 Difference]: Without dead ends: 415 [2025-04-13 17:47:49,511 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=503, Invalid=3787, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 17:47:49,511 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:49,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 0 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:47:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-04-13 17:47:49,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 335. [2025-04-13 17:47:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.062874251497006) internal successors, (1023), 334 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 17:47:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1023 transitions. [2025-04-13 17:47:49,942 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 1023 transitions. Word has length 28 [2025-04-13 17:47:49,942 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:49,942 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 1023 transitions. [2025-04-13 17:47:49,942 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:49,943 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 1023 transitions. [2025-04-13 17:47:49,943 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:49,943 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:49,943 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 17:47:49,951 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 17:47:50,143 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2025-04-13 17:47:50,143 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 17:47:50,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1610074359, now seen corresponding path program 51 times [2025-04-13 17:47:50,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:50,144 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545406098] [2025-04-13 17:47:50,144 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:47:50,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:50,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:50,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 17:47:50,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:47:50,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:50,626 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 17:47:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:50,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545406098] [2025-04-13 17:47:50,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545406098] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:50,627 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796879194] [2025-04-13 17:47:50,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:47:50,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:50,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:50,628 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 17:47:50,629 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 17:47:50,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:47:50,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 17:47:50,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:47:50,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:50,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:47:50,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:51,020 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:47:51,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:47:51,041 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 17:47:51,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:51,197 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:47:51,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:47:51,670 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 17:47:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796879194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:51,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 17:47:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185986879] [2025-04-13 17:47:51,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:51,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:47:51,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:51,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:47:51,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:47:51,671 INFO L87 Difference]: Start difference. First operand 335 states and 1023 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 17:47:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:47:53,791 INFO L93 Difference]: Finished difference Result 451 states and 1283 transitions. [2025-04-13 17:47:53,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 17:47:53,792 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 17:47:53,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:47:53,793 INFO L225 Difference]: With dead ends: 451 [2025-04-13 17:47:53,793 INFO L226 Difference]: Without dead ends: 416 [2025-04-13 17:47:53,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=436, Invalid=2986, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:47:53,794 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:47:53,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:47:53,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-04-13 17:47:54,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 341. [2025-04-13 17:47:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.070588235294118) internal successors, (1044), 340 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:47:54,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1044 transitions. [2025-04-13 17:47:54,260 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 1044 transitions. Word has length 28 [2025-04-13 17:47:54,260 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:47:54,260 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 1044 transitions. [2025-04-13 17:47:54,260 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 17:47:54,260 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 1044 transitions. [2025-04-13 17:47:54,260 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:47:54,260 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:47:54,260 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 17:47:54,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-13 17:47:54,461 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:54,461 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 17:47:54,461 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:47:54,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1787267801, now seen corresponding path program 52 times [2025-04-13 17:47:54,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:47:54,461 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822493760] [2025-04-13 17:47:54,461 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:47:54,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:47:54,470 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:47:54,475 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:47:54,475 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:47:54,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:54,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 17:47:54,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:47:54,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822493760] [2025-04-13 17:47:54,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822493760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:47:54,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328230511] [2025-04-13 17:47:54,668 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:47:54,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:47:54,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:47:54,669 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 17:47:54,670 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 17:47:54,880 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:47:54,888 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:47:54,888 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:47:54,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:47:54,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:47:54,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:47:55,047 INFO L325 Elim1Store]: treesize reduction 15, result has 71.7 percent of original size [2025-04-13 17:47:55,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 83 [2025-04-13 17:47:55,084 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 17:47:55,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:47:55,532 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:47:55,533 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 233 [2025-04-13 17:47:58,045 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 17:47:58,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328230511] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:47:58,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:47:58,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2025-04-13 17:47:58,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073386610] [2025-04-13 17:47:58,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:47:58,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:47:58,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:47:58,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:47:58,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:47:58,047 INFO L87 Difference]: Start difference. First operand 341 states and 1044 transitions. Second operand has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 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 17:48:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:02,614 INFO L93 Difference]: Finished difference Result 574 states and 1532 transitions. [2025-04-13 17:48:02,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 17:48:02,614 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 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 28 [2025-04-13 17:48:02,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:02,617 INFO L225 Difference]: With dead ends: 574 [2025-04-13 17:48:02,617 INFO L226 Difference]: Without dead ends: 535 [2025-04-13 17:48:02,618 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1760 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=749, Invalid=4951, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:48:02,618 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:02,618 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 0 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:48:02,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2025-04-13 17:48:03,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 371. [2025-04-13 17:48:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 3.137837837837838) internal successors, (1161), 370 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1161 transitions. [2025-04-13 17:48:03,123 INFO L79 Accepts]: Start accepts. Automaton has 371 states and 1161 transitions. Word has length 28 [2025-04-13 17:48:03,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:03,123 INFO L485 AbstractCegarLoop]: Abstraction has 371 states and 1161 transitions. [2025-04-13 17:48:03,123 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 24 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 17:48:03,124 INFO L278 IsEmpty]: Start isEmpty. Operand 371 states and 1161 transitions. [2025-04-13 17:48:03,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:03,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:03,124 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 17:48:03,132 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 17:48:03,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:03,324 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 17:48:03,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1784730761, now seen corresponding path program 53 times [2025-04-13 17:48:03,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:03,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456852724] [2025-04-13 17:48:03,325 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:48:03,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:03,334 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:03,348 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:03,348 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:48:03,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:48:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:04,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456852724] [2025-04-13 17:48:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456852724] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:04,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673189390] [2025-04-13 17:48:04,052 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:48:04,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:04,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:04,054 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 17:48:04,056 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 17:48:04,277 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:04,430 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:04,430 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:48:04,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:04,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 17:48:04,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:04,667 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:48:04,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:48:04,699 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 17:48:04,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:04,818 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:04,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:48:05,419 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 17:48:05,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673189390] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:05,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:05,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 9] total 37 [2025-04-13 17:48:05,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813904978] [2025-04-13 17:48:05,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:05,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 17:48:05,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:05,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 17:48:05,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1282, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:48:05,420 INFO L87 Difference]: Start difference. First operand 371 states and 1161 transitions. Second operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:07,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:07,861 INFO L93 Difference]: Finished difference Result 482 states and 1361 transitions. [2025-04-13 17:48:07,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 17:48:07,861 INFO L79 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:48:07,862 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:07,864 INFO L225 Difference]: With dead ends: 482 [2025-04-13 17:48:07,864 INFO L226 Difference]: Without dead ends: 447 [2025-04-13 17:48:07,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1032 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=510, Invalid=5190, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:48:07,864 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:07,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:48:07,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-04-13 17:48:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 375. [2025-04-13 17:48:08,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 3.1310160427807485) internal successors, (1171), 374 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:08,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1171 transitions. [2025-04-13 17:48:08,401 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 1171 transitions. Word has length 28 [2025-04-13 17:48:08,401 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:08,401 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 1171 transitions. [2025-04-13 17:48:08,401 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 38 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:08,401 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 1171 transitions. [2025-04-13 17:48:08,402 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:08,402 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:08,402 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 17:48:08,410 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 17:48:08,602 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:08,603 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 17:48:08,603 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:08,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1673908241, now seen corresponding path program 54 times [2025-04-13 17:48:08,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:08,603 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269577865] [2025-04-13 17:48:08,603 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:48:08,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:08,616 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:08,633 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:08,633 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:48:08,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:09,027 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 17:48:09,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:09,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269577865] [2025-04-13 17:48:09,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269577865] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:09,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634211703] [2025-04-13 17:48:09,027 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:48:09,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:09,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:09,029 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 17:48:09,030 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 17:48:09,252 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:09,282 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:09,283 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:48:09,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:09,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:48:09,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:09,422 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:48:09,423 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:48:09,444 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 17:48:09,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:09,569 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:09,570 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:48:10,084 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 17:48:10,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634211703] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:10,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:10,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 17:48:10,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873780955] [2025-04-13 17:48:10,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:10,084 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:48:10,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:10,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:48:10,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:48:10,085 INFO L87 Difference]: Start difference. First operand 375 states and 1171 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:12,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:12,024 INFO L93 Difference]: Finished difference Result 467 states and 1347 transitions. [2025-04-13 17:48:12,024 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 17:48:12,024 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:48:12,024 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:12,026 INFO L225 Difference]: With dead ends: 467 [2025-04-13 17:48:12,026 INFO L226 Difference]: Without dead ends: 448 [2025-04-13 17:48:12,027 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=317, Invalid=2035, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:48:12,027 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 132 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:12,027 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 0 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:48:12,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-04-13 17:48:12,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 375. [2025-04-13 17:48:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 3.125668449197861) internal successors, (1169), 374 states have internal predecessors, (1169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1169 transitions. [2025-04-13 17:48:12,576 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 1169 transitions. Word has length 28 [2025-04-13 17:48:12,576 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:12,576 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 1169 transitions. [2025-04-13 17:48:12,576 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:12,576 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 1169 transitions. [2025-04-13 17:48:12,576 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:12,576 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:12,576 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 17:48:12,585 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 17:48:12,777 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:12,777 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 17:48:12,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1761589879, now seen corresponding path program 55 times [2025-04-13 17:48:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:12,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031058582] [2025-04-13 17:48:12,777 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:48:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:12,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:48:12,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:12,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:12,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:13,323 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 17:48:13,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:13,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031058582] [2025-04-13 17:48:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031058582] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:13,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379776934] [2025-04-13 17:48:13,324 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:48:13,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:13,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:13,326 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 17:48:13,326 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 17:48:13,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:48:13,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:13,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:13,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:13,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:48:13,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:13,771 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:48:13,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:48:13,799 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 17:48:13,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:14,020 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:14,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 230 treesize of output 228 [2025-04-13 17:48:14,689 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 17:48:14,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379776934] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:14,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:14,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 17:48:14,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166909340] [2025-04-13 17:48:14,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:14,689 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:48:14,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:14,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:48:14,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:48:14,690 INFO L87 Difference]: Start difference. First operand 375 states and 1169 transitions. Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:17,028 INFO L93 Difference]: Finished difference Result 449 states and 1322 transitions. [2025-04-13 17:48:17,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:48:17,029 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:48:17,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:17,031 INFO L225 Difference]: With dead ends: 449 [2025-04-13 17:48:17,031 INFO L226 Difference]: Without dead ends: 424 [2025-04-13 17:48:17,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=468, Invalid=3564, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 17:48:17,031 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 164 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:17,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 0 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:48:17,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2025-04-13 17:48:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 375. [2025-04-13 17:48:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 374 states have (on average 3.120320855614973) internal successors, (1167), 374 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 1167 transitions. [2025-04-13 17:48:17,565 INFO L79 Accepts]: Start accepts. Automaton has 375 states and 1167 transitions. Word has length 28 [2025-04-13 17:48:17,565 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:17,565 INFO L485 AbstractCegarLoop]: Abstraction has 375 states and 1167 transitions. [2025-04-13 17:48:17,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:17,565 INFO L278 IsEmpty]: Start isEmpty. Operand 375 states and 1167 transitions. [2025-04-13 17:48:17,566 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:17,566 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:17,566 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 17:48:17,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-13 17:48:17,766 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:17,766 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 17:48:17,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash -536096401, now seen corresponding path program 56 times [2025-04-13 17:48:17,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:17,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249501734] [2025-04-13 17:48:17,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:48:17,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:17,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:48:17,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:17,790 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:48:17,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:18,257 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 17:48:18,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:18,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249501734] [2025-04-13 17:48:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249501734] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:18,257 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020039968] [2025-04-13 17:48:18,257 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:48:18,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:18,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:18,259 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 17:48:18,260 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 17:48:18,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:48:18,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:18,501 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:48:18,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:18,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:48:18,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:18,804 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:48:18,804 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:48:18,825 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 17:48:18,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:18,975 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:18,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 199 treesize of output 197 [2025-04-13 17:48:19,483 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 17:48:19,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020039968] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:19,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:19,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 17:48:19,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723596911] [2025-04-13 17:48:19,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:19,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:48:19,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:19,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:48:19,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:48:19,484 INFO L87 Difference]: Start difference. First operand 375 states and 1167 transitions. Second operand has 33 states, 32 states have (on average 1.875) internal successors, (60), 33 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 17:48:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:21,986 INFO L93 Difference]: Finished difference Result 510 states and 1482 transitions. [2025-04-13 17:48:21,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 17:48:21,986 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 33 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 28 [2025-04-13 17:48:21,986 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:21,988 INFO L225 Difference]: With dead ends: 510 [2025-04-13 17:48:21,988 INFO L226 Difference]: Without dead ends: 484 [2025-04-13 17:48:21,989 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=538, Invalid=4154, Unknown=0, NotChecked=0, Total=4692 [2025-04-13 17:48:21,989 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:21,989 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 0 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:48:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-04-13 17:48:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 379. [2025-04-13 17:48:22,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 378 states have (on average 3.1296296296296298) internal successors, (1183), 378 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:22,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 1183 transitions. [2025-04-13 17:48:22,516 INFO L79 Accepts]: Start accepts. Automaton has 379 states and 1183 transitions. Word has length 28 [2025-04-13 17:48:22,516 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:22,516 INFO L485 AbstractCegarLoop]: Abstraction has 379 states and 1183 transitions. [2025-04-13 17:48:22,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.875) internal successors, (60), 33 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 17:48:22,517 INFO L278 IsEmpty]: Start isEmpty. Operand 379 states and 1183 transitions. [2025-04-13 17:48:22,517 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:22,517 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:22,517 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 17:48:22,525 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 17:48:22,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable74 [2025-04-13 17:48:22,718 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 17:48:22,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:22,718 INFO L85 PathProgramCache]: Analyzing trace with hash -483510481, now seen corresponding path program 57 times [2025-04-13 17:48:22,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:22,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368985455] [2025-04-13 17:48:22,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:48:22,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:22,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:22,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 17:48:22,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:48:22,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:23,152 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 17:48:23,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:23,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368985455] [2025-04-13 17:48:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368985455] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:23,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413946397] [2025-04-13 17:48:23,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:48:23,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:23,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:23,154 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 17:48:23,155 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 17:48:23,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:23,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 28 statements. [2025-04-13 17:48:23,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:48:23,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:23,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:48:23,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:23,576 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:48:23,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 75 treesize of output 47 [2025-04-13 17:48:23,602 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 17:48:23,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:23,718 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:23,719 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:48:24,453 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 17:48:24,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413946397] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:24,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:24,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 17:48:24,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761896808] [2025-04-13 17:48:24,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:24,453 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:48:24,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:24,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:48:24,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:48:24,454 INFO L87 Difference]: Start difference. First operand 379 states and 1183 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:26,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:26,906 INFO L93 Difference]: Finished difference Result 554 states and 1541 transitions. [2025-04-13 17:48:26,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 17:48:26,906 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:48:26,906 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:26,908 INFO L225 Difference]: With dead ends: 554 [2025-04-13 17:48:26,908 INFO L226 Difference]: Without dead ends: 520 [2025-04-13 17:48:26,909 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1339 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=539, Invalid=4017, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:48:26,909 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 171 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:26,909 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 0 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:48:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-04-13 17:48:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 385. [2025-04-13 17:48:27,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 3.1302083333333335) internal successors, (1202), 384 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:27,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 1202 transitions. [2025-04-13 17:48:27,448 INFO L79 Accepts]: Start accepts. Automaton has 385 states and 1202 transitions. Word has length 28 [2025-04-13 17:48:27,448 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:27,448 INFO L485 AbstractCegarLoop]: Abstraction has 385 states and 1202 transitions. [2025-04-13 17:48:27,448 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:27,448 INFO L278 IsEmpty]: Start isEmpty. Operand 385 states and 1202 transitions. [2025-04-13 17:48:27,449 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:27,449 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:27,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 17:48:27,457 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 17:48:27,649 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2025-04-13 17:48:27,649 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 17:48:27,650 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:27,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2091031667, now seen corresponding path program 58 times [2025-04-13 17:48:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:27,650 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441759557] [2025-04-13 17:48:27,650 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:48:27,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:27,660 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:48:27,663 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:48:27,663 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:48:27,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:27,862 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 17:48:27,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:27,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441759557] [2025-04-13 17:48:27,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441759557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:27,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507891583] [2025-04-13 17:48:27,862 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:48:27,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:27,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:27,864 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 17:48:27,865 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 17:48:28,092 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:48:28,099 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:48:28,099 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:48:28,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:28,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:48:28,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:28,208 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:48:28,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:48:28,233 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 17:48:28,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:28,373 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:28,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:48:28,926 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 17:48:28,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507891583] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:28,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:28,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-04-13 17:48:28,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680127896] [2025-04-13 17:48:28,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:28,927 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:48:28,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:28,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:48:28,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:48:28,927 INFO L87 Difference]: Start difference. First operand 385 states and 1202 transitions. Second operand has 21 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:30,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:30,749 INFO L93 Difference]: Finished difference Result 483 states and 1421 transitions. [2025-04-13 17:48:30,749 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:48:30,749 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:48:30,749 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:30,751 INFO L225 Difference]: With dead ends: 483 [2025-04-13 17:48:30,751 INFO L226 Difference]: Without dead ends: 460 [2025-04-13 17:48:30,751 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=202, Invalid=1438, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:48:30,751 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:30,751 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:48:30,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-04-13 17:48:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 389. [2025-04-13 17:48:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 388 states have (on average 3.1288659793814433) internal successors, (1214), 388 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 1214 transitions. [2025-04-13 17:48:31,305 INFO L79 Accepts]: Start accepts. Automaton has 389 states and 1214 transitions. Word has length 28 [2025-04-13 17:48:31,305 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:31,305 INFO L485 AbstractCegarLoop]: Abstraction has 389 states and 1214 transitions. [2025-04-13 17:48:31,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.75) internal successors, (35), 21 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:31,306 INFO L278 IsEmpty]: Start isEmpty. Operand 389 states and 1214 transitions. [2025-04-13 17:48:31,306 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:31,306 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:31,306 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 17:48:31,314 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 17:48:31,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2025-04-13 17:48:31,507 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 17:48:31,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:31,507 INFO L85 PathProgramCache]: Analyzing trace with hash 361528735, now seen corresponding path program 59 times [2025-04-13 17:48:31,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:31,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489335195] [2025-04-13 17:48:31,507 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:48:31,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:31,516 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:31,534 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:31,535 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:48:31,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:32,042 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:48:32,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:32,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489335195] [2025-04-13 17:48:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489335195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:32,042 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813348421] [2025-04-13 17:48:32,042 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:48:32,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:32,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:32,044 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 17:48:32,045 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 17:48:32,283 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:32,331 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:32,332 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:48:32,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:32,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:48:32,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:32,559 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:48:32,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 83 treesize of output 52 [2025-04-13 17:48:32,589 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 17:48:32,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:32,731 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:32,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 17:48:33,419 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 17:48:33,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813348421] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:33,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:33,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2025-04-13 17:48:33,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906277605] [2025-04-13 17:48:33,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:33,419 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 17:48:33,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:33,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 17:48:33,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:48:33,420 INFO L87 Difference]: Start difference. First operand 389 states and 1214 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 35 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 17:48:36,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:36,042 INFO L93 Difference]: Finished difference Result 565 states and 1605 transitions. [2025-04-13 17:48:36,042 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 17:48:36,043 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 35 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 28 [2025-04-13 17:48:36,043 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:36,044 INFO L225 Difference]: With dead ends: 565 [2025-04-13 17:48:36,044 INFO L226 Difference]: Without dead ends: 529 [2025-04-13 17:48:36,045 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1298 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=568, Invalid=5132, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:48:36,045 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:36,045 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:48:36,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-04-13 17:48:36,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 411. [2025-04-13 17:48:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.1634146341463416) internal successors, (1297), 410 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1297 transitions. [2025-04-13 17:48:36,659 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 1297 transitions. Word has length 28 [2025-04-13 17:48:36,659 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:36,659 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 1297 transitions. [2025-04-13 17:48:36,659 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 35 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 17:48:36,659 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 1297 transitions. [2025-04-13 17:48:36,660 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:36,660 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:36,660 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 17:48:36,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-13 17:48:36,860 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2025-04-13 17:48:36,860 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 17:48:36,861 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash 364065775, now seen corresponding path program 60 times [2025-04-13 17:48:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:36,861 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627435449] [2025-04-13 17:48:36,861 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:48:36,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:36,871 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:36,885 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:36,885 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:48:36,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:37,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 17:48:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:37,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627435449] [2025-04-13 17:48:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627435449] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:37,251 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699591237] [2025-04-13 17:48:37,251 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:48:37,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:37,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:37,253 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 17:48:37,254 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 17:48:37,488 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:37,519 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:37,519 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:48:37,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:37,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 17:48:37,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:37,756 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:48:37,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:48:37,781 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 17:48:37,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:37,903 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:37,903 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:48:38,551 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 17:48:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699591237] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:38,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:38,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 17:48:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727621616] [2025-04-13 17:48:38,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:38,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:48:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:38,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:48:38,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:48:38,552 INFO L87 Difference]: Start difference. First operand 411 states and 1297 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:40,992 INFO L93 Difference]: Finished difference Result 598 states and 1656 transitions. [2025-04-13 17:48:40,992 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 17:48:40,992 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:48:40,992 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:40,994 INFO L225 Difference]: With dead ends: 598 [2025-04-13 17:48:40,994 INFO L226 Difference]: Without dead ends: 564 [2025-04-13 17:48:40,995 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=530, Invalid=4026, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:48:40,995 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:40,995 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:48:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-04-13 17:48:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 413. [2025-04-13 17:48:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 3.145631067961165) internal successors, (1296), 412 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1296 transitions. [2025-04-13 17:48:41,612 INFO L79 Accepts]: Start accepts. Automaton has 413 states and 1296 transitions. Word has length 28 [2025-04-13 17:48:41,612 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:41,612 INFO L485 AbstractCegarLoop]: Abstraction has 413 states and 1296 transitions. [2025-04-13 17:48:41,612 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:41,612 INFO L278 IsEmpty]: Start isEmpty. Operand 413 states and 1296 transitions. [2025-04-13 17:48:41,613 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:41,613 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:41,613 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 17:48:41,621 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 17:48:41,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:41,814 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 17:48:41,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:41,814 INFO L85 PathProgramCache]: Analyzing trace with hash 474888295, now seen corresponding path program 61 times [2025-04-13 17:48:41,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:41,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483284382] [2025-04-13 17:48:41,814 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:48:41,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:41,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:48:41,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:41,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:41,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:42,353 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 17:48:42,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:42,353 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483284382] [2025-04-13 17:48:42,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483284382] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:42,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108598756] [2025-04-13 17:48:42,354 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:48:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:42,355 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 17:48:42,356 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 17:48:42,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:48:42,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:42,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:48:42,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:42,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:48:42,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:42,752 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:48:42,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:48:42,779 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 17:48:42,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:42,925 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:42,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:48:43,365 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:48:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108598756] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:43,366 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 17:48:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367011536] [2025-04-13 17:48:43,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:43,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:48:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:43,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:48:43,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=834, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:48:43,366 INFO L87 Difference]: Start difference. First operand 413 states and 1296 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 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 17:48:45,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:45,680 INFO L93 Difference]: Finished difference Result 511 states and 1507 transitions. [2025-04-13 17:48:45,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-04-13 17:48:45,680 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 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 17:48:45,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:45,682 INFO L225 Difference]: With dead ends: 511 [2025-04-13 17:48:45,682 INFO L226 Difference]: Without dead ends: 492 [2025-04-13 17:48:45,682 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=389, Invalid=3393, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 17:48:45,683 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 182 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:45,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 0 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:48:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-04-13 17:48:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 417. [2025-04-13 17:48:46,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.1490384615384617) internal successors, (1310), 416 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1310 transitions. [2025-04-13 17:48:46,297 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1310 transitions. Word has length 28 [2025-04-13 17:48:46,297 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:46,297 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1310 transitions. [2025-04-13 17:48:46,297 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 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 17:48:46,297 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1310 transitions. [2025-04-13 17:48:46,298 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:46,298 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:46,298 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 17:48:46,305 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 17:48:46,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:46,498 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 17:48:46,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:46,499 INFO L85 PathProgramCache]: Analyzing trace with hash -384580881, now seen corresponding path program 62 times [2025-04-13 17:48:46,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:46,499 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898270488] [2025-04-13 17:48:46,499 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:48:46,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:46,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:48:46,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:46,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:48:46,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:46,967 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 17:48:46,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:46,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898270488] [2025-04-13 17:48:46,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898270488] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:46,967 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164595084] [2025-04-13 17:48:46,967 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:48:46,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:46,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:46,969 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 17:48:46,970 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 17:48:47,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:48:47,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:48:47,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:48:47,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:47,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:48:47,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:47,532 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:48:47,532 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:48:47,560 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 17:48:47,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:47,747 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:47,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:48:48,483 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 17:48:48,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164595084] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:48,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:48,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 32 [2025-04-13 17:48:48,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527620875] [2025-04-13 17:48:48,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:48,483 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 17:48:48,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:48,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 17:48:48,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:48:48,484 INFO L87 Difference]: Start difference. First operand 417 states and 1310 transitions. Second operand has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:50,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:50,574 INFO L93 Difference]: Finished difference Result 503 states and 1491 transitions. [2025-04-13 17:48:50,575 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:48:50,575 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:48:50,575 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:50,577 INFO L225 Difference]: With dead ends: 503 [2025-04-13 17:48:50,577 INFO L226 Difference]: Without dead ends: 475 [2025-04-13 17:48:50,577 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=349, Invalid=2843, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:48:50,577 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 151 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:50,577 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 0 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:48:50,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-04-13 17:48:51,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 417. [2025-04-13 17:48:51,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.139423076923077) internal successors, (1306), 416 states have internal predecessors, (1306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1306 transitions. [2025-04-13 17:48:51,200 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1306 transitions. Word has length 28 [2025-04-13 17:48:51,200 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:51,200 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1306 transitions. [2025-04-13 17:48:51,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.84375) internal successors, (59), 33 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:51,200 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1306 transitions. [2025-04-13 17:48:51,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:51,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:51,201 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 17:48:51,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2025-04-13 17:48:51,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:51,401 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 17:48:51,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:51,402 INFO L85 PathProgramCache]: Analyzing trace with hash -954628569, now seen corresponding path program 63 times [2025-04-13 17:48:51,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:51,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800451707] [2025-04-13 17:48:51,402 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:48:51,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:51,411 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:51,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 17:48:51,420 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:48:51,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:51,799 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 17:48:51,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:51,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800451707] [2025-04-13 17:48:51,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800451707] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:51,800 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510478743] [2025-04-13 17:48:51,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:48:51,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:51,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:51,801 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 17:48:51,803 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 17:48:52,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:48:52,062 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 28 statements. [2025-04-13 17:48:52,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:48:52,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:52,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:48:52,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:52,231 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:48:52,232 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:48:52,250 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 17:48:52,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:52,397 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:52,398 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 17:48:53,195 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 17:48:53,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510478743] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:53,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:53,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 17:48:53,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412385588] [2025-04-13 17:48:53,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:53,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:48:53,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:53,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:48:53,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:48:53,196 INFO L87 Difference]: Start difference. First operand 417 states and 1306 transitions. Second operand has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:55,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:55,562 INFO L93 Difference]: Finished difference Result 625 states and 1789 transitions. [2025-04-13 17:48:55,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 17:48:55,562 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:48:55,562 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:55,564 INFO L225 Difference]: With dead ends: 625 [2025-04-13 17:48:55,564 INFO L226 Difference]: Without dead ends: 603 [2025-04-13 17:48:55,564 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=2537, Unknown=0, NotChecked=0, Total=2862 [2025-04-13 17:48:55,564 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 155 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:55,564 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 0 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:48:55,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-04-13 17:48:56,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 425. [2025-04-13 17:48:56,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.141509433962264) internal successors, (1332), 424 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1332 transitions. [2025-04-13 17:48:56,186 INFO L79 Accepts]: Start accepts. Automaton has 425 states and 1332 transitions. Word has length 28 [2025-04-13 17:48:56,186 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:48:56,187 INFO L485 AbstractCegarLoop]: Abstraction has 425 states and 1332 transitions. [2025-04-13 17:48:56,187 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 24 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:56,187 INFO L278 IsEmpty]: Start isEmpty. Operand 425 states and 1332 transitions. [2025-04-13 17:48:56,187 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:48:56,187 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:48:56,187 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 17:48:56,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2025-04-13 17:48:56,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable81 [2025-04-13 17:48:56,388 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 17:48:56,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:48:56,388 INFO L85 PathProgramCache]: Analyzing trace with hash -952091529, now seen corresponding path program 64 times [2025-04-13 17:48:56,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:48:56,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800937422] [2025-04-13 17:48:56,388 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:48:56,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:48:56,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:48:56,402 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:48:56,402 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:48:56,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:56,580 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 17:48:56,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:48:56,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800937422] [2025-04-13 17:48:56,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800937422] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:48:56,581 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857895435] [2025-04-13 17:48:56,581 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:48:56,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:48:56,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:48:56,582 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 17:48:56,583 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 17:48:56,827 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-13 17:48:56,835 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 15 of 28 statements. [2025-04-13 17:48:56,835 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:48:56,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:48:56,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:48:56,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:48:56,931 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:48:56,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:48:56,954 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 17:48:56,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:48:57,069 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:48:57,070 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:48:57,644 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 17:48:57,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857895435] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:48:57,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:48:57,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-04-13 17:48:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532309978] [2025-04-13 17:48:57,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:48:57,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:48:57,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:48:57,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:48:57,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:48:57,645 INFO L87 Difference]: Start difference. First operand 425 states and 1332 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:48:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:48:59,854 INFO L93 Difference]: Finished difference Result 597 states and 1731 transitions. [2025-04-13 17:48:59,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 17:48:59,854 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have 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 17:48:59,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:48:59,856 INFO L225 Difference]: With dead ends: 597 [2025-04-13 17:48:59,856 INFO L226 Difference]: Without dead ends: 580 [2025-04-13 17:48:59,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=1565, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:48:59,856 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 133 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:48:59,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 0 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:48:59,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2025-04-13 17:49:00,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 429. [2025-04-13 17:49:00,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 428 states have (on average 3.1448598130841123) internal successors, (1346), 428 states have internal predecessors, (1346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:00,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 1346 transitions. [2025-04-13 17:49:00,512 INFO L79 Accepts]: Start accepts. Automaton has 429 states and 1346 transitions. Word has length 28 [2025-04-13 17:49:00,513 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:00,513 INFO L485 AbstractCegarLoop]: Abstraction has 429 states and 1346 transitions. [2025-04-13 17:49:00,513 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 19 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:00,513 INFO L278 IsEmpty]: Start isEmpty. Operand 429 states and 1346 transitions. [2025-04-13 17:49:00,513 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:49:00,513 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:00,513 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 17:49:00,521 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 17:49:00,713 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:00,714 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 17:49:00,714 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:00,714 INFO L85 PathProgramCache]: Analyzing trace with hash -841269009, now seen corresponding path program 65 times [2025-04-13 17:49:00,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:00,714 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993128177] [2025-04-13 17:49:00,714 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:49:00,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:00,724 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:49:00,737 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:49:00,737 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:49:00,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:01,317 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:49:01,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:01,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993128177] [2025-04-13 17:49:01,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993128177] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:01,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494193821] [2025-04-13 17:49:01,318 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:49:01,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:01,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:01,319 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 17:49:01,320 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 17:49:01,566 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:49:01,607 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:49:01,607 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:49:01,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:01,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:49:01,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:01,823 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:49:01,823 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:49:01,854 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 17:49:01,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:02,007 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:49:02,007 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:49:02,478 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 17:49:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494193821] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:02,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:02,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12, 9] total 33 [2025-04-13 17:49:02,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257245851] [2025-04-13 17:49:02,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:02,479 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:49:02,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:02,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:49:02,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1017, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:49:02,479 INFO L87 Difference]: Start difference. First operand 429 states and 1346 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 17:49:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:04,965 INFO L93 Difference]: Finished difference Result 567 states and 1661 transitions. [2025-04-13 17:49:04,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 17:49:04,965 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 28 [2025-04-13 17:49:04,965 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:04,967 INFO L225 Difference]: With dead ends: 567 [2025-04-13 17:49:04,967 INFO L226 Difference]: Without dead ends: 548 [2025-04-13 17:49:04,967 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=371, Invalid=3535, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 17:49:04,968 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:04,968 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:49:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-04-13 17:49:05,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 431. [2025-04-13 17:49:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 3.146511627906977) internal successors, (1353), 430 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:05,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1353 transitions. [2025-04-13 17:49:05,645 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1353 transitions. Word has length 28 [2025-04-13 17:49:05,645 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:05,645 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1353 transitions. [2025-04-13 17:49:05,645 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 17:49:05,645 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1353 transitions. [2025-04-13 17:49:05,645 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:49:05,645 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:05,645 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 17:49:05,653 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 17:49:05,846 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:05,846 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 17:49:05,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:05,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1700738185, now seen corresponding path program 66 times [2025-04-13 17:49:05,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:05,846 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125655965] [2025-04-13 17:49:05,846 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:05,856 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:49:05,866 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 17:49:05,866 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:49:05,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:06,293 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 17:49:06,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:06,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125655965] [2025-04-13 17:49:06,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125655965] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:06,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446452410] [2025-04-13 17:49:06,293 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:06,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:06,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:06,295 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 17:49:06,296 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 17:49:06,551 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-04-13 17:49:06,571 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 24 of 28 statements. [2025-04-13 17:49:06,571 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-13 17:49:06,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:06,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:49:06,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:06,772 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:49:06,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:49:06,795 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 17:49:06,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:06,953 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:49:06,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:49:07,425 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 17:49:07,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446452410] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:07,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:07,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 17:49:07,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707651220] [2025-04-13 17:49:07,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:07,425 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:49:07,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:07,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:49:07,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:49:07,426 INFO L87 Difference]: Start difference. First operand 431 states and 1353 transitions. Second operand has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:09,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:09,397 INFO L93 Difference]: Finished difference Result 545 states and 1618 transitions. [2025-04-13 17:49:09,397 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-13 17:49:09,397 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:49:09,397 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:09,399 INFO L225 Difference]: With dead ends: 545 [2025-04-13 17:49:09,399 INFO L226 Difference]: Without dead ends: 521 [2025-04-13 17:49:09,399 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:49:09,399 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 148 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:09,399 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 0 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:09,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-04-13 17:49:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 431. [2025-04-13 17:49:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 3.141860465116279) internal successors, (1351), 430 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1351 transitions. [2025-04-13 17:49:10,053 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1351 transitions. Word has length 28 [2025-04-13 17:49:10,053 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:10,053 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1351 transitions. [2025-04-13 17:49:10,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.9) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:10,053 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1351 transitions. [2025-04-13 17:49:10,054 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-13 17:49:10,054 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:10,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 17:49:10,061 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 17:49:10,254 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable84 [2025-04-13 17:49:10,254 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 17:49:10,254 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1719172211, now seen corresponding path program 67 times [2025-04-13 17:49:10,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:10,255 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994057177] [2025-04-13 17:49:10,255 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:10,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:10,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:49:10,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:49:10,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:10,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:10,786 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 17:49:10,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:10,786 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994057177] [2025-04-13 17:49:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994057177] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:10,787 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505876428] [2025-04-13 17:49:10,787 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:10,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:10,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:10,788 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 17:49:10,789 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 17:49:11,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-13 17:49:11,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-13 17:49:11,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:11,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:11,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 17:49:11,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:11,269 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:49:11,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:49:11,295 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 17:49:11,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:11,551 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:49:11,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 211 [2025-04-13 17:49:12,124 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 17:49:12,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505876428] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:12,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:12,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 33 [2025-04-13 17:49:12,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051326348] [2025-04-13 17:49:12,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:12,124 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:49:12,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:12,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:49:12,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1011, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:49:12,125 INFO L87 Difference]: Start difference. First operand 431 states and 1351 transitions. Second operand has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:14,616 INFO L93 Difference]: Finished difference Result 538 states and 1602 transitions. [2025-04-13 17:49:14,616 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:49:14,617 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-13 17:49:14,617 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:14,618 INFO L225 Difference]: With dead ends: 538 [2025-04-13 17:49:14,618 INFO L226 Difference]: Without dead ends: 519 [2025-04-13 17:49:14,619 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 904 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=489, Invalid=3543, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 17:49:14,620 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:14,620 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:49:14,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-04-13 17:49:15,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 431. [2025-04-13 17:49:15,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 3.1372093023255814) internal successors, (1349), 430 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:15,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1349 transitions. [2025-04-13 17:49:15,301 INFO L79 Accepts]: Start accepts. Automaton has 431 states and 1349 transitions. Word has length 28 [2025-04-13 17:49:15,301 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:15,301 INFO L485 AbstractCegarLoop]: Abstraction has 431 states and 1349 transitions. [2025-04-13 17:49:15,301 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:15,301 INFO L278 IsEmpty]: Start isEmpty. Operand 431 states and 1349 transitions. [2025-04-13 17:49:15,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:15,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:15,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 17:49:15,309 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 17:49:15,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:15,502 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 17:49:15,503 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:15,503 INFO L85 PathProgramCache]: Analyzing trace with hash -991782398, now seen corresponding path program 68 times [2025-04-13 17:49:15,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:15,503 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405084398] [2025-04-13 17:49:15,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:49:15,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:15,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:49:15,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:15,531 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:49:15,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:15,885 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 17:49:15,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:15,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405084398] [2025-04-13 17:49:15,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405084398] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:15,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852017675] [2025-04-13 17:49:15,885 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:49:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:15,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:15,887 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 17:49:15,888 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 17:49:16,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:49:16,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:16,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:49:16,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:16,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 17:49:16,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:16,348 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 17:49:16,349 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:16,561 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 17:49:16,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 17:49:16,710 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 17:49:16,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852017675] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:16,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:16,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-04-13 17:49:16,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330826461] [2025-04-13 17:49:16,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:16,710 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:49:16,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:16,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:49:16,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:49:16,711 INFO L87 Difference]: Start difference. First operand 431 states and 1349 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 17:49:18,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:18,424 INFO L93 Difference]: Finished difference Result 524 states and 1565 transitions. [2025-04-13 17:49:18,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 17:49:18,425 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 17:49:18,425 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:18,427 INFO L225 Difference]: With dead ends: 524 [2025-04-13 17:49:18,427 INFO L226 Difference]: Without dead ends: 517 [2025-04-13 17:49:18,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:49:18,427 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:18,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-04-13 17:49:19,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 427. [2025-04-13 17:49:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 426 states have (on average 3.136150234741784) internal successors, (1336), 426 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 1336 transitions. [2025-04-13 17:49:19,095 INFO L79 Accepts]: Start accepts. Automaton has 427 states and 1336 transitions. Word has length 29 [2025-04-13 17:49:19,095 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:19,095 INFO L485 AbstractCegarLoop]: Abstraction has 427 states and 1336 transitions. [2025-04-13 17:49:19,095 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 17:49:19,095 INFO L278 IsEmpty]: Start isEmpty. Operand 427 states and 1336 transitions. [2025-04-13 17:49:19,096 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:19,096 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:19,096 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 17:49:19,104 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 17:49:19,296 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:19,296 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 17:49:19,296 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:19,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1550165386, now seen corresponding path program 69 times [2025-04-13 17:49:19,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:19,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240512115] [2025-04-13 17:49:19,297 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:49:19,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:19,307 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:19,316 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 17:49:19,316 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:49:19,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:19,586 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 17:49:19,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:19,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240512115] [2025-04-13 17:49:19,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240512115] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:19,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265666268] [2025-04-13 17:49:19,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:49:19,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:19,588 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 17:49:19,589 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 17:49:19,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:19,865 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 29 statements. [2025-04-13 17:49:19,865 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 17:49:19,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:19,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 17:49:19,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:19,976 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 17:49:19,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:20,132 INFO L325 Elim1Store]: treesize reduction 30, result has 82.8 percent of original size [2025-04-13 17:49:20,133 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 163 [2025-04-13 17:49:20,258 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 17:49:20,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265666268] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:20,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:20,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 21 [2025-04-13 17:49:20,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555210239] [2025-04-13 17:49:20,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:20,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:49:20,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:20,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:49:20,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:49:20,259 INFO L87 Difference]: Start difference. First operand 427 states and 1336 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:21,818 INFO L93 Difference]: Finished difference Result 505 states and 1516 transitions. [2025-04-13 17:49:21,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:49:21,818 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:49:21,818 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:21,820 INFO L225 Difference]: With dead ends: 505 [2025-04-13 17:49:21,820 INFO L226 Difference]: Without dead ends: 498 [2025-04-13 17:49:21,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:49:21,820 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:21,820 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 699 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:21,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-04-13 17:49:22,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 425. [2025-04-13 17:49:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.134433962264151) internal successors, (1329), 424 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:22,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1329 transitions. [2025-04-13 17:49:22,503 INFO L79 Accepts]: Start accepts. Automaton has 425 states and 1329 transitions. Word has length 29 [2025-04-13 17:49:22,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:22,503 INFO L485 AbstractCegarLoop]: Abstraction has 425 states and 1329 transitions. [2025-04-13 17:49:22,503 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:22,503 INFO L278 IsEmpty]: Start isEmpty. Operand 425 states and 1329 transitions. [2025-04-13 17:49:22,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:22,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:22,504 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 17:49:22,511 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2025-04-13 17:49:22,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:22,704 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 17:49:22,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1675111520, now seen corresponding path program 70 times [2025-04-13 17:49:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:22,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779159407] [2025-04-13 17:49:22,705 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:49:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:22,715 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:49:22,718 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 17:49:22,718 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:49:22,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:22,841 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 17:49:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:22,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779159407] [2025-04-13 17:49:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779159407] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:22,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636382607] [2025-04-13 17:49:22,841 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:49:22,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:22,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:22,843 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 17:49:22,844 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 17:49:23,106 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:49:23,114 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 17:49:23,114 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:49:23,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:23,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-13 17:49:23,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:23,182 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 17:49:23,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:23,345 INFO L325 Elim1Store]: treesize reduction 30, result has 82.8 percent of original size [2025-04-13 17:49:23,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 70 treesize of output 163 [2025-04-13 17:49:23,446 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 17:49:23,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636382607] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:23,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:23,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-04-13 17:49:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825003347] [2025-04-13 17:49:23,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:23,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 17:49:23,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:23,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 17:49:23,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-13 17:49:23,447 INFO L87 Difference]: Start difference. First operand 425 states and 1329 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:25,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:25,252 INFO L93 Difference]: Finished difference Result 535 states and 1587 transitions. [2025-04-13 17:49:25,252 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:49:25,252 INFO L79 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have 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 17:49:25,252 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:25,254 INFO L225 Difference]: With dead ends: 535 [2025-04-13 17:49:25,254 INFO L226 Difference]: Without dead ends: 528 [2025-04-13 17:49:25,254 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:49:25,254 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:25,254 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:25,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-04-13 17:49:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 425. [2025-04-13 17:49:25,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 3.1297169811320753) internal successors, (1327), 424 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:25,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1327 transitions. [2025-04-13 17:49:25,924 INFO L79 Accepts]: Start accepts. Automaton has 425 states and 1327 transitions. Word has length 29 [2025-04-13 17:49:25,924 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:25,924 INFO L485 AbstractCegarLoop]: Abstraction has 425 states and 1327 transitions. [2025-04-13 17:49:25,924 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 17 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:25,924 INFO L278 IsEmpty]: Start isEmpty. Operand 425 states and 1327 transitions. [2025-04-13 17:49:25,925 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:25,925 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:25,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 17:49:25,934 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 17:49:26,125 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2025-04-13 17:49:26,125 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 17:49:26,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:26,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1356837948, now seen corresponding path program 71 times [2025-04-13 17:49:26,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:26,126 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396421561] [2025-04-13 17:49:26,126 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:49:26,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:26,137 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:26,154 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:26,155 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:49:26,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:26,479 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:49:26,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:26,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396421561] [2025-04-13 17:49:26,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396421561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:26,479 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102677108] [2025-04-13 17:49:26,480 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:49:26,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:26,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:26,481 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 17:49:26,482 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 17:49:26,748 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:26,811 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:26,811 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:49:26,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:26,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:49:26,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:26,987 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 17:49:26,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:27,098 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:49:27,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 46 treesize of output 83 [2025-04-13 17:49:27,143 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 17:49:27,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102677108] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:27,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:27,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 9] total 27 [2025-04-13 17:49:27,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688875839] [2025-04-13 17:49:27,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:27,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:49:27,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:27,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:49:27,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:49:27,145 INFO L87 Difference]: Start difference. First operand 425 states and 1327 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 17:49:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:28,828 INFO L93 Difference]: Finished difference Result 494 states and 1488 transitions. [2025-04-13 17:49:28,828 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:49:28,828 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 17:49:28,828 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:28,830 INFO L225 Difference]: With dead ends: 494 [2025-04-13 17:49:28,830 INFO L226 Difference]: Without dead ends: 487 [2025-04-13 17:49:28,830 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=1128, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:49:28,830 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 65 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:28,830 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 0 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-04-13 17:49:29,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 421. [2025-04-13 17:49:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.126190476190476) internal successors, (1313), 420 states have internal predecessors, (1313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1313 transitions. [2025-04-13 17:49:29,475 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1313 transitions. Word has length 29 [2025-04-13 17:49:29,475 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:29,475 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1313 transitions. [2025-04-13 17:49:29,475 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 17:49:29,475 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1313 transitions. [2025-04-13 17:49:29,476 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:29,476 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:29,476 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 17:49:29,484 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 17:49:29,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2025-04-13 17:49:29,676 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 17:49:29,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:29,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1811849228, now seen corresponding path program 72 times [2025-04-13 17:49:29,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:29,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812405630] [2025-04-13 17:49:29,677 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:29,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:29,687 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:29,703 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:29,703 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:49:29,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:30,008 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 17:49:30,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:30,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812405630] [2025-04-13 17:49:30,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812405630] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:30,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987494346] [2025-04-13 17:49:30,008 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:30,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:30,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:30,010 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 17:49:30,010 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 17:49:30,284 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:30,312 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:30,312 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:49:30,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:30,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:49:30,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:30,445 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 17:49:30,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:30,604 INFO L325 Elim1Store]: treesize reduction 32, result has 82.2 percent of original size [2025-04-13 17:49:30,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 167 [2025-04-13 17:49:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:49:30,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987494346] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:30,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:30,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 23 [2025-04-13 17:49:30,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465928389] [2025-04-13 17:49:30,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:30,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:49:30,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:30,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:49:30,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:49:30,719 INFO L87 Difference]: Start difference. First operand 421 states and 1313 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 17:49:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:32,564 INFO L93 Difference]: Finished difference Result 515 states and 1534 transitions. [2025-04-13 17:49:32,564 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:49:32,564 INFO L79 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:49:32,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:32,566 INFO L225 Difference]: With dead ends: 515 [2025-04-13 17:49:32,566 INFO L226 Difference]: Without dead ends: 508 [2025-04-13 17:49:32,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 17:49:32,567 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:32,567 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2025-04-13 17:49:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 421. [2025-04-13 17:49:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 3.1214285714285714) internal successors, (1311), 420 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1311 transitions. [2025-04-13 17:49:33,223 INFO L79 Accepts]: Start accepts. Automaton has 421 states and 1311 transitions. Word has length 29 [2025-04-13 17:49:33,223 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:33,223 INFO L485 AbstractCegarLoop]: Abstraction has 421 states and 1311 transitions. [2025-04-13 17:49:33,223 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 17:49:33,223 INFO L278 IsEmpty]: Start isEmpty. Operand 421 states and 1311 transitions. [2025-04-13 17:49:33,223 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:33,223 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:33,223 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 17:49:33,234 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 17:49:33,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:33,424 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 17:49:33,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1585492932, now seen corresponding path program 73 times [2025-04-13 17:49:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:33,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976888083] [2025-04-13 17:49:33,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:33,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:49:33,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:33,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:33,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:33,903 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 17:49:33,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:33,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976888083] [2025-04-13 17:49:33,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976888083] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:33,904 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782363728] [2025-04-13 17:49:33,904 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:33,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:33,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:33,906 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 17:49:33,906 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 17:49:34,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:49:34,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:34,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:34,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:34,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:49:34,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:34,292 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 17:49:34,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:34,368 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:49:34,369 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 17:49:34,455 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 17:49:34,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782363728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:34,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:34,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 29 [2025-04-13 17:49:34,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165274613] [2025-04-13 17:49:34,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:34,456 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:49:34,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:34,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:49:34,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:49:34,456 INFO L87 Difference]: Start difference. First operand 421 states and 1311 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 17:49:36,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:36,610 INFO L93 Difference]: Finished difference Result 546 states and 1580 transitions. [2025-04-13 17:49:36,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:49:36,610 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 17:49:36,610 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:36,611 INFO L225 Difference]: With dead ends: 546 [2025-04-13 17:49:36,612 INFO L226 Difference]: Without dead ends: 539 [2025-04-13 17:49:36,612 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=286, Invalid=2264, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:49:36,612 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:36,612 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 0 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:49:36,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-04-13 17:49:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 419. [2025-04-13 17:49:37,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 418 states have (on average 3.1148325358851676) internal successors, (1302), 418 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1302 transitions. [2025-04-13 17:49:37,257 INFO L79 Accepts]: Start accepts. Automaton has 419 states and 1302 transitions. Word has length 29 [2025-04-13 17:49:37,257 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:37,257 INFO L485 AbstractCegarLoop]: Abstraction has 419 states and 1302 transitions. [2025-04-13 17:49:37,257 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 17:49:37,257 INFO L278 IsEmpty]: Start isEmpty. Operand 419 states and 1302 transitions. [2025-04-13 17:49:37,258 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:37,258 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:37,258 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 17:49:37,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-04-13 17:49:37,458 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable91 [2025-04-13 17:49:37,458 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 17:49:37,458 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:37,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1174269498, now seen corresponding path program 74 times [2025-04-13 17:49:37,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:37,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928411984] [2025-04-13 17:49:37,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:49:37,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:37,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:49:37,478 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:37,478 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:49:37,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:37,803 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 17:49:37,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:37,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928411984] [2025-04-13 17:49:37,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928411984] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:37,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714375914] [2025-04-13 17:49:37,804 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:49:37,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:37,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:37,806 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 17:49:37,806 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 17:49:38,096 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:49:38,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:38,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:49:38,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:38,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:49:38,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:38,238 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 17:49:38,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:38,337 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:49:38,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 50 treesize of output 87 [2025-04-13 17:49:38,406 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 17:49:38,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714375914] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:38,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:38,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 23 [2025-04-13 17:49:38,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630926481] [2025-04-13 17:49:38,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:38,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 17:49:38,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:38,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 17:49:38,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2025-04-13 17:49:38,407 INFO L87 Difference]: Start difference. First operand 419 states and 1302 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 17:49:40,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:40,154 INFO L93 Difference]: Finished difference Result 497 states and 1487 transitions. [2025-04-13 17:49:40,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:49:40,154 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 17:49:40,154 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:40,156 INFO L225 Difference]: With dead ends: 497 [2025-04-13 17:49:40,156 INFO L226 Difference]: Without dead ends: 490 [2025-04-13 17:49:40,156 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:49:40,156 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 90 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:40,156 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 0 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-04-13 17:49:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 411. [2025-04-13 17:49:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.102439024390244) internal successors, (1272), 410 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:40,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1272 transitions. [2025-04-13 17:49:40,792 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 1272 transitions. Word has length 29 [2025-04-13 17:49:40,792 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:40,792 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 1272 transitions. [2025-04-13 17:49:40,792 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 17:49:40,792 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 1272 transitions. [2025-04-13 17:49:40,792 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:40,793 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:40,793 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 17:49:40,800 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 17:49:40,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:40,993 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 17:49:40,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -131353760, now seen corresponding path program 75 times [2025-04-13 17:49:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:40,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634670738] [2025-04-13 17:49:40,993 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:49:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:41,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:41,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 17:49:41,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:49:41,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:41,301 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 17:49:41,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:41,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634670738] [2025-04-13 17:49:41,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634670738] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:41,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321634754] [2025-04-13 17:49:41,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:49:41,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:41,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:41,304 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 17:49:41,305 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 17:49:41,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:41,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 17:49:41,613 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:49:41,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:41,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:49:41,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:41,770 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 17:49:41,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:41,954 INFO L325 Elim1Store]: treesize reduction 32, result has 81.6 percent of original size [2025-04-13 17:49:41,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 161 [2025-04-13 17:49:42,067 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 17:49:42,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321634754] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:42,067 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:42,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2025-04-13 17:49:42,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353146513] [2025-04-13 17:49:42,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:42,067 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 17:49:42,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:42,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 17:49:42,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2025-04-13 17:49:42,068 INFO L87 Difference]: Start difference. First operand 411 states and 1272 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 17:49:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:44,000 INFO L93 Difference]: Finished difference Result 523 states and 1515 transitions. [2025-04-13 17:49:44,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-13 17:49:44,001 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 17:49:44,001 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:44,003 INFO L225 Difference]: With dead ends: 523 [2025-04-13 17:49:44,003 INFO L226 Difference]: Without dead ends: 516 [2025-04-13 17:49:44,003 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:49:44,003 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 80 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:44,003 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 0 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:44,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-04-13 17:49:44,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 411. [2025-04-13 17:49:44,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 3.102439024390244) internal successors, (1272), 410 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1272 transitions. [2025-04-13 17:49:44,674 INFO L79 Accepts]: Start accepts. Automaton has 411 states and 1272 transitions. Word has length 29 [2025-04-13 17:49:44,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:44,674 INFO L485 AbstractCegarLoop]: Abstraction has 411 states and 1272 transitions. [2025-04-13 17:49:44,674 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 17:49:44,674 INFO L278 IsEmpty]: Start isEmpty. Operand 411 states and 1272 transitions. [2025-04-13 17:49:44,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:44,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:44,675 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 17:49:44,683 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2025-04-13 17:49:44,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:44,875 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 17:49:44,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:44,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1686289026, now seen corresponding path program 76 times [2025-04-13 17:49:44,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:44,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504234875] [2025-04-13 17:49:44,876 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:49:44,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:44,886 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:49:44,889 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 17:49:44,889 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:49:44,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:44,999 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 17:49:44,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:44,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504234875] [2025-04-13 17:49:44,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504234875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:44,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380232124] [2025-04-13 17:49:44,999 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:49:44,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:44,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:45,001 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 17:49:45,003 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 17:49:45,284 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:49:45,292 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 17:49:45,292 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:49:45,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:45,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:49:45,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:45,389 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 17:49:45,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:45,557 INFO L325 Elim1Store]: treesize reduction 32, result has 81.6 percent of original size [2025-04-13 17:49:45,558 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 161 [2025-04-13 17:49:45,640 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 17:49:45,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380232124] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:45,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:45,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-04-13 17:49:45,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756881545] [2025-04-13 17:49:45,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:45,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 17:49:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:45,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 17:49:45,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2025-04-13 17:49:45,641 INFO L87 Difference]: Start difference. First operand 411 states and 1272 transitions. Second operand has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:47,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:47,340 INFO L93 Difference]: Finished difference Result 507 states and 1474 transitions. [2025-04-13 17:49:47,341 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 17:49:47,341 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:49:47,341 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:47,342 INFO L225 Difference]: With dead ends: 507 [2025-04-13 17:49:47,342 INFO L226 Difference]: Without dead ends: 496 [2025-04-13 17:49:47,343 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:49:47,343 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:47,343 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 0 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:49:47,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-04-13 17:49:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 417. [2025-04-13 17:49:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.0985576923076925) internal successors, (1289), 416 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1289 transitions. [2025-04-13 17:49:48,000 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1289 transitions. Word has length 29 [2025-04-13 17:49:48,001 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:48,001 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1289 transitions. [2025-04-13 17:49:48,001 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 19 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:48,001 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1289 transitions. [2025-04-13 17:49:48,001 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:48,001 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:48,001 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 17:49:48,008 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 17:49:48,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:48,202 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 17:49:48,202 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:48,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1367922617, now seen corresponding path program 77 times [2025-04-13 17:49:48,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:48,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677649586] [2025-04-13 17:49:48,202 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:49:48,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:48,212 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:48,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:48,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:49:48,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:48,632 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:49:48,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:48,632 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677649586] [2025-04-13 17:49:48,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677649586] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:48,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755131384] [2025-04-13 17:49:48,633 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:49:48,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:48,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:48,634 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 17:49:48,635 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 17:49:48,932 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:49,036 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:49,036 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:49:49,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:49,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:49:49,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:49,194 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 17:49:49,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:49,293 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:49:49,293 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 17:49:49,380 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 17:49:49,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755131384] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:49,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:49,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 31 [2025-04-13 17:49:49,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19262283] [2025-04-13 17:49:49,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:49,381 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:49:49,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:49,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:49:49,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=827, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:49:49,383 INFO L87 Difference]: Start difference. First operand 417 states and 1289 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 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 17:49:51,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:51,614 INFO L93 Difference]: Finished difference Result 499 states and 1480 transitions. [2025-04-13 17:49:51,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 17:49:51,614 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 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 29 [2025-04-13 17:49:51,614 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:51,616 INFO L225 Difference]: With dead ends: 499 [2025-04-13 17:49:51,616 INFO L226 Difference]: Without dead ends: 491 [2025-04-13 17:49:51,616 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=345, Invalid=2847, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:49:51,616 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1489 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:51,616 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 1497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:49:51,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-13 17:49:52,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 417. [2025-04-13 17:49:52,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 3.09375) internal successors, (1287), 416 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:52,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 1287 transitions. [2025-04-13 17:49:52,294 INFO L79 Accepts]: Start accepts. Automaton has 417 states and 1287 transitions. Word has length 29 [2025-04-13 17:49:52,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:52,294 INFO L485 AbstractCegarLoop]: Abstraction has 417 states and 1287 transitions. [2025-04-13 17:49:52,294 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 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 17:49:52,294 INFO L278 IsEmpty]: Start isEmpty. Operand 417 states and 1287 transitions. [2025-04-13 17:49:52,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:52,294 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:52,295 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 17:49:52,303 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 17:49:52,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:52,495 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 17:49:52,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:52,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1037796262, now seen corresponding path program 78 times [2025-04-13 17:49:52,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:52,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102077573] [2025-04-13 17:49:52,495 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:52,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:52,506 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:52,527 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:52,527 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:49:52,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:52,954 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 17:49:52,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:52,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102077573] [2025-04-13 17:49:52,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102077573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:52,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721958550] [2025-04-13 17:49:52,954 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:49:52,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:52,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:52,956 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 17:49:52,957 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 17:49:53,256 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:49:53,281 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:53,281 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:49:53,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:53,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:49:53,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:53,371 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 17:49:53,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:53,473 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:49:53,474 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 17:49:53,539 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 17:49:53,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721958550] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:53,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:53,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 21 [2025-04-13 17:49:53,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122323445] [2025-04-13 17:49:53,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:53,540 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:49:53,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:53,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:49:53,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:49:53,540 INFO L87 Difference]: Start difference. First operand 417 states and 1287 transitions. Second operand has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:55,283 INFO L93 Difference]: Finished difference Result 497 states and 1485 transitions. [2025-04-13 17:49:55,283 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:49:55,283 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:49:55,283 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:55,285 INFO L225 Difference]: With dead ends: 497 [2025-04-13 17:49:55,285 INFO L226 Difference]: Without dead ends: 486 [2025-04-13 17:49:55,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:49:55,285 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 115 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:55,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 0 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:49:55,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-04-13 17:49:55,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 406. [2025-04-13 17:49:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 405 states have (on average 3.091358024691358) internal successors, (1252), 405 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:55,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 1252 transitions. [2025-04-13 17:49:55,919 INFO L79 Accepts]: Start accepts. Automaton has 406 states and 1252 transitions. Word has length 29 [2025-04-13 17:49:55,919 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:49:55,919 INFO L485 AbstractCegarLoop]: Abstraction has 406 states and 1252 transitions. [2025-04-13 17:49:55,919 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0476190476190474) internal successors, (43), 21 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:49:55,919 INFO L278 IsEmpty]: Start isEmpty. Operand 406 states and 1252 transitions. [2025-04-13 17:49:55,919 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:49:55,919 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:49:55,919 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 17:49:55,927 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 17:49:56,120 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:56,120 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 17:49:56,120 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:49:56,120 INFO L85 PathProgramCache]: Analyzing trace with hash -104332553, now seen corresponding path program 79 times [2025-04-13 17:49:56,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:49:56,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821370003] [2025-04-13 17:49:56,120 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:56,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:49:56,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:49:56,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:56,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:56,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:56,543 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 17:49:56,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:49:56,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821370003] [2025-04-13 17:49:56,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821370003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:49:56,543 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425761935] [2025-04-13 17:49:56,544 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:49:56,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:49:56,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:49:56,545 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 17:49:56,546 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 17:49:56,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:49:56,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:49:56,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:49:56,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:49:56,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:49:56,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:49:56,954 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 17:49:56,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:49:57,080 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 17:49:57,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 214 [2025-04-13 17:49:57,322 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 17:49:57,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [425761935] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:49:57,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:49:57,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 17:49:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996706628] [2025-04-13 17:49:57,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:49:57,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:49:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:49:57,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:49:57,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:49:57,323 INFO L87 Difference]: Start difference. First operand 406 states and 1252 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 17:49:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:49:59,558 INFO L93 Difference]: Finished difference Result 580 states and 1618 transitions. [2025-04-13 17:49:59,558 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:49:59,558 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 17:49:59,558 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:49:59,560 INFO L225 Difference]: With dead ends: 580 [2025-04-13 17:49:59,560 INFO L226 Difference]: Without dead ends: 563 [2025-04-13 17:49:59,560 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=419, Invalid=2887, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:49:59,561 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:49:59,561 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:49:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-04-13 17:50:00,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 432. [2025-04-13 17:50:00,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.1299303944315544) internal successors, (1349), 431 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:00,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1349 transitions. [2025-04-13 17:50:00,251 INFO L79 Accepts]: Start accepts. Automaton has 432 states and 1349 transitions. Word has length 29 [2025-04-13 17:50:00,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:00,251 INFO L485 AbstractCegarLoop]: Abstraction has 432 states and 1349 transitions. [2025-04-13 17:50:00,251 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 17:50:00,251 INFO L278 IsEmpty]: Start isEmpty. Operand 432 states and 1349 transitions. [2025-04-13 17:50:00,251 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:00,251 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:00,251 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 17:50:00,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2025-04-13 17:50:00,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2025-04-13 17:50:00,452 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 17:50:00,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:00,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1411344154, now seen corresponding path program 80 times [2025-04-13 17:50:00,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:00,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193951235] [2025-04-13 17:50:00,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:00,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:00,463 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:00,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:00,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:50:00,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:00,830 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 17:50:00,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:00,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193951235] [2025-04-13 17:50:00,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193951235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:00,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206185529] [2025-04-13 17:50:00,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:00,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:00,832 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 17:50:00,833 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 17:50:01,144 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:01,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:01,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:50:01,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:01,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:50:01,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:01,333 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 17:50:01,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:01,403 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:50:01,404 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 17:50:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-04-13 17:50:01,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206185529] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:01,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:01,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 31 [2025-04-13 17:50:01,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706288877] [2025-04-13 17:50:01,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:01,498 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:50:01,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:01,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:50:01,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:50:01,499 INFO L87 Difference]: Start difference. First operand 432 states and 1349 transitions. Second operand has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:03,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:03,594 INFO L93 Difference]: Finished difference Result 530 states and 1558 transitions. [2025-04-13 17:50:03,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:50:03,594 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:50:03,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:03,596 INFO L225 Difference]: With dead ends: 530 [2025-04-13 17:50:03,596 INFO L226 Difference]: Without dead ends: 520 [2025-04-13 17:50:03,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=339, Invalid=2211, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:50:03,597 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:03,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:50:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-04-13 17:50:04,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 432. [2025-04-13 17:50:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.1113689095127612) internal successors, (1341), 431 states have internal predecessors, (1341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1341 transitions. [2025-04-13 17:50:04,303 INFO L79 Accepts]: Start accepts. Automaton has 432 states and 1341 transitions. Word has length 29 [2025-04-13 17:50:04,304 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:04,304 INFO L485 AbstractCegarLoop]: Abstraction has 432 states and 1341 transitions. [2025-04-13 17:50:04,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.967741935483871) internal successors, (61), 31 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:04,304 INFO L278 IsEmpty]: Start isEmpty. Operand 432 states and 1341 transitions. [2025-04-13 17:50:04,305 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:04,305 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:04,305 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 17:50:04,314 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 17:50:04,506 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2025-04-13 17:50:04,506 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 17:50:04,506 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1497231607, now seen corresponding path program 81 times [2025-04-13 17:50:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:04,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690941949] [2025-04-13 17:50:04,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:04,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:04,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:04,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:04,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:50:04,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:04,828 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 17:50:04,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:04,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690941949] [2025-04-13 17:50:04,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690941949] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:04,829 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231900971] [2025-04-13 17:50:04,829 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:04,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:04,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:04,830 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 17:50:04,831 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 17:50:05,136 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:05,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:05,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:50:05,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:05,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:50:05,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:05,270 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 17:50:05,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:05,347 INFO L325 Elim1Store]: treesize reduction 11, result has 85.7 percent of original size [2025-04-13 17:50:05,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 81 [2025-04-13 17:50:05,430 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 17:50:05,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231900971] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:05,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:05,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 22 [2025-04-13 17:50:05,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362158414] [2025-04-13 17:50:05,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:05,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:50:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:05,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:50:05,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:50:05,431 INFO L87 Difference]: Start difference. First operand 432 states and 1341 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:07,067 INFO L93 Difference]: Finished difference Result 523 states and 1522 transitions. [2025-04-13 17:50:07,068 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:50:07,068 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:50:07,068 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:07,069 INFO L225 Difference]: With dead ends: 523 [2025-04-13 17:50:07,069 INFO L226 Difference]: Without dead ends: 515 [2025-04-13 17:50:07,069 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:50:07,070 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:07,070 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 0 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:07,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-04-13 17:50:07,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 432. [2025-04-13 17:50:07,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.1067285382830625) internal successors, (1339), 431 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:07,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1339 transitions. [2025-04-13 17:50:07,762 INFO L79 Accepts]: Start accepts. Automaton has 432 states and 1339 transitions. Word has length 29 [2025-04-13 17:50:07,762 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:07,762 INFO L485 AbstractCegarLoop]: Abstraction has 432 states and 1339 transitions. [2025-04-13 17:50:07,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 22 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:07,762 INFO L278 IsEmpty]: Start isEmpty. Operand 432 states and 1339 transitions. [2025-04-13 17:50:07,762 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:07,762 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:07,762 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 17:50:07,770 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 17:50:07,963 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2025-04-13 17:50:07,963 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 17:50:07,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:07,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1918941354, now seen corresponding path program 82 times [2025-04-13 17:50:07,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:07,963 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108201154] [2025-04-13 17:50:07,963 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:07,974 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:07,978 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 17:50:07,978 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:50:07,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:08,116 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 17:50:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:08,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108201154] [2025-04-13 17:50:08,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108201154] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:08,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9463624] [2025-04-13 17:50:08,116 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:08,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:08,118 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 17:50:08,119 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 17:50:08,409 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:08,417 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 17:50:08,417 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:50:08,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:08,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:50:08,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:08,496 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 17:50:08,497 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:08,677 INFO L325 Elim1Store]: treesize reduction 22, result has 87.4 percent of original size [2025-04-13 17:50:08,677 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 171 [2025-04-13 17:50:08,836 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 17:50:08,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9463624] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:08,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:08,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-04-13 17:50:08,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013474216] [2025-04-13 17:50:08,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:08,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 17:50:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:08,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 17:50:08,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-04-13 17:50:08,837 INFO L87 Difference]: Start difference. First operand 432 states and 1339 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:10,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:10,763 INFO L93 Difference]: Finished difference Result 566 states and 1641 transitions. [2025-04-13 17:50:10,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:50:10,763 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:50:10,763 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:10,765 INFO L225 Difference]: With dead ends: 566 [2025-04-13 17:50:10,765 INFO L226 Difference]: Without dead ends: 555 [2025-04-13 17:50:10,765 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:50:10,765 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 79 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:10,765 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 0 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:50:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-04-13 17:50:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 430. [2025-04-13 17:50:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.086247086247086) internal successors, (1324), 429 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1324 transitions. [2025-04-13 17:50:11,465 INFO L79 Accepts]: Start accepts. Automaton has 430 states and 1324 transitions. Word has length 29 [2025-04-13 17:50:11,465 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:11,465 INFO L485 AbstractCegarLoop]: Abstraction has 430 states and 1324 transitions. [2025-04-13 17:50:11,465 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 22 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:11,465 INFO L278 IsEmpty]: Start isEmpty. Operand 430 states and 1324 transitions. [2025-04-13 17:50:11,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:11,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:11,466 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 17:50:11,473 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 17:50:11,666 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable100 [2025-04-13 17:50:11,666 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 17:50:11,666 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:11,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1556634756, now seen corresponding path program 83 times [2025-04-13 17:50:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:11,667 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578735434] [2025-04-13 17:50:11,667 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:50:11,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:11,677 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:11,690 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:11,690 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:50:11,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:50:12,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:12,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578735434] [2025-04-13 17:50:12,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578735434] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:12,061 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348090702] [2025-04-13 17:50:12,061 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:50:12,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:12,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:12,063 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 17:50:12,063 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 17:50:12,378 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:12,470 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:12,470 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:50:12,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:12,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:50:12,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:12,618 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 17:50:12,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:12,710 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:50:12,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 17:50:12,790 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 17:50:12,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348090702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:12,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:12,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 9] total 31 [2025-04-13 17:50:12,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920541312] [2025-04-13 17:50:12,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:12,791 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:50:12,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:12,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:50:12,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:50:12,791 INFO L87 Difference]: Start difference. First operand 430 states and 1324 transitions. Second operand has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:15,185 INFO L93 Difference]: Finished difference Result 577 states and 1686 transitions. [2025-04-13 17:50:15,185 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:50:15,185 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:50:15,186 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:15,188 INFO L225 Difference]: With dead ends: 577 [2025-04-13 17:50:15,188 INFO L226 Difference]: Without dead ends: 570 [2025-04-13 17:50:15,188 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=359, Invalid=2947, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 17:50:15,188 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 126 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:15,188 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 0 Invalid, 1234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:50:15,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-04-13 17:50:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 444. [2025-04-13 17:50:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 443 states have (on average 3.1038374717832955) internal successors, (1375), 443 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:15,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 1375 transitions. [2025-04-13 17:50:15,922 INFO L79 Accepts]: Start accepts. Automaton has 444 states and 1375 transitions. Word has length 29 [2025-04-13 17:50:15,922 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:15,922 INFO L485 AbstractCegarLoop]: Abstraction has 444 states and 1375 transitions. [2025-04-13 17:50:15,922 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.064516129032258) internal successors, (64), 31 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:15,922 INFO L278 IsEmpty]: Start isEmpty. Operand 444 states and 1375 transitions. [2025-04-13 17:50:15,923 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:15,923 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:15,923 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:50:15,931 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 17:50:16,123 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable101,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:16,123 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 17:50:16,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:16,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1236519123, now seen corresponding path program 84 times [2025-04-13 17:50:16,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:16,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724106659] [2025-04-13 17:50:16,124 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:50:16,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:16,134 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:16,152 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:16,152 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:50:16,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:16,473 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 17:50:16,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:16,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724106659] [2025-04-13 17:50:16,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724106659] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:16,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634703197] [2025-04-13 17:50:16,473 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:50:16,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:16,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:16,475 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 17:50:16,475 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 17:50:16,771 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:16,801 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:16,801 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:50:16,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:16,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 17:50:16,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:16,938 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 17:50:16,938 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:17,020 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:50:17,021 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 17:50:17,098 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 17:50:17,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634703197] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:17,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:17,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 29 [2025-04-13 17:50:17,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126195840] [2025-04-13 17:50:17,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:17,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:50:17,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:17,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:50:17,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=701, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:50:17,099 INFO L87 Difference]: Start difference. First operand 444 states and 1375 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 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 17:50:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:19,158 INFO L93 Difference]: Finished difference Result 528 states and 1586 transitions. [2025-04-13 17:50:19,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:50:19,159 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 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 17:50:19,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:19,160 INFO L225 Difference]: With dead ends: 528 [2025-04-13 17:50:19,160 INFO L226 Difference]: Without dead ends: 517 [2025-04-13 17:50:19,160 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=306, Invalid=1856, Unknown=0, NotChecked=0, Total=2162 [2025-04-13 17:50:19,161 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:19,161 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:50:19,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2025-04-13 17:50:19,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 442. [2025-04-13 17:50:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 441 states have (on average 3.0884353741496597) internal successors, (1362), 441 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:19,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1362 transitions. [2025-04-13 17:50:19,883 INFO L79 Accepts]: Start accepts. Automaton has 442 states and 1362 transitions. Word has length 29 [2025-04-13 17:50:19,883 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:19,883 INFO L485 AbstractCegarLoop]: Abstraction has 442 states and 1362 transitions. [2025-04-13 17:50:19,883 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 29 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 17:50:19,883 INFO L278 IsEmpty]: Start isEmpty. Operand 442 states and 1362 transitions. [2025-04-13 17:50:19,883 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:19,883 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:19,883 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 17:50:19,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2025-04-13 17:50:20,084 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2025-04-13 17:50:20,084 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 17:50:20,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:20,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1329400839, now seen corresponding path program 85 times [2025-04-13 17:50:20,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:20,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135011768] [2025-04-13 17:50:20,084 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:50:20,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:20,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:50:20,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:20,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:20,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:20,574 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 17:50:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:20,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135011768] [2025-04-13 17:50:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135011768] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:20,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835053662] [2025-04-13 17:50:20,575 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:50:20,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:20,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:20,577 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 17:50:20,578 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 17:50:20,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:50:20,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:20,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:20,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:20,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-13 17:50:20,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:21,012 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 17:50:21,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:21,121 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:50:21,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 87 [2025-04-13 17:50:21,191 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 17:50:21,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835053662] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:21,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:21,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 30 [2025-04-13 17:50:21,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582651269] [2025-04-13 17:50:21,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:21,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:50:21,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:21,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:50:21,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:50:21,192 INFO L87 Difference]: Start difference. First operand 442 states and 1362 transitions. Second operand has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:23,021 INFO L93 Difference]: Finished difference Result 496 states and 1502 transitions. [2025-04-13 17:50:23,021 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:50:23,021 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:50:23,021 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:23,022 INFO L225 Difference]: With dead ends: 496 [2025-04-13 17:50:23,022 INFO L226 Difference]: Without dead ends: 485 [2025-04-13 17:50:23,023 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=2095, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:50:23,023 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:23,023 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:50:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-04-13 17:50:23,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 432. [2025-04-13 17:50:23,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.074245939675174) internal successors, (1325), 431 states have internal predecessors, (1325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:23,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1325 transitions. [2025-04-13 17:50:23,724 INFO L79 Accepts]: Start accepts. Automaton has 432 states and 1325 transitions. Word has length 29 [2025-04-13 17:50:23,724 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:23,724 INFO L485 AbstractCegarLoop]: Abstraction has 432 states and 1325 transitions. [2025-04-13 17:50:23,724 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7) internal successors, (51), 30 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:23,725 INFO L278 IsEmpty]: Start isEmpty. Operand 432 states and 1325 transitions. [2025-04-13 17:50:23,725 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:23,725 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:23,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 17:50:23,733 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 17:50:23,925 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 17:50:23,926 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 17:50:23,926 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:23,926 INFO L85 PathProgramCache]: Analyzing trace with hash -550149364, now seen corresponding path program 86 times [2025-04-13 17:50:23,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:23,926 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754452957] [2025-04-13 17:50:23,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:23,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:23,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:23,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:23,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:50:23,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:24,263 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 17:50:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:24,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754452957] [2025-04-13 17:50:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754452957] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:24,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418011371] [2025-04-13 17:50:24,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:24,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:24,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:24,265 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 17:50:24,265 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 17:50:24,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:24,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:24,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:50:24,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:24,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 17:50:24,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-13 17:50:24,766 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:24,958 INFO L325 Elim1Store]: treesize reduction 43, result has 72.4 percent of original size [2025-04-13 17:50:24,958 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 128 [2025-04-13 17:50:25,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 17:50:25,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418011371] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:25,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:25,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 27 [2025-04-13 17:50:25,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368023697] [2025-04-13 17:50:25,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:25,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:50:25,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:25,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:50:25,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:50:25,012 INFO L87 Difference]: Start difference. First operand 432 states and 1325 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 17:50:27,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:27,071 INFO L93 Difference]: Finished difference Result 556 states and 1615 transitions. [2025-04-13 17:50:27,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 17:50:27,072 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 17:50:27,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:27,073 INFO L225 Difference]: With dead ends: 556 [2025-04-13 17:50:27,073 INFO L226 Difference]: Without dead ends: 549 [2025-04-13 17:50:27,073 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=1387, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:50:27,073 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 88 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:27,074 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 0 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:50:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2025-04-13 17:50:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 432. [2025-04-13 17:50:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.0788863109048723) internal successors, (1327), 431 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1327 transitions. [2025-04-13 17:50:27,788 INFO L79 Accepts]: Start accepts. Automaton has 432 states and 1327 transitions. Word has length 29 [2025-04-13 17:50:27,788 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:27,788 INFO L485 AbstractCegarLoop]: Abstraction has 432 states and 1327 transitions. [2025-04-13 17:50:27,788 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 17:50:27,788 INFO L278 IsEmpty]: Start isEmpty. Operand 432 states and 1327 transitions. [2025-04-13 17:50:27,788 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:27,789 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:27,789 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 17:50:27,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2025-04-13 17:50:27,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable104 [2025-04-13 17:50:27,989 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 17:50:27,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:27,989 INFO L85 PathProgramCache]: Analyzing trace with hash 2076523106, now seen corresponding path program 87 times [2025-04-13 17:50:27,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:27,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154171686] [2025-04-13 17:50:27,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:27,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:28,000 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:28,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 17:50:28,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:50:28,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:28,290 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 17:50:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:28,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154171686] [2025-04-13 17:50:28,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154171686] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:28,290 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523476917] [2025-04-13 17:50:28,290 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:28,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:28,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:28,292 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 17:50:28,293 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 17:50:28,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:28,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 17:50:28,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:50:28,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:28,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:50:28,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:28,782 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 17:50:28,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:28,970 INFO L325 Elim1Store]: treesize reduction 43, result has 72.4 percent of original size [2025-04-13 17:50:28,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 128 [2025-04-13 17:50:29,044 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 17:50:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523476917] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:29,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:29,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 17:50:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097559270] [2025-04-13 17:50:29,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:29,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:50:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:29,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:50:29,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:50:29,046 INFO L87 Difference]: Start difference. First operand 432 states and 1327 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 17:50:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:31,661 INFO L93 Difference]: Finished difference Result 622 states and 1731 transitions. [2025-04-13 17:50:31,661 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:50:31,661 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 17:50:31,661 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:31,663 INFO L225 Difference]: With dead ends: 622 [2025-04-13 17:50:31,663 INFO L226 Difference]: Without dead ends: 615 [2025-04-13 17:50:31,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=314, Invalid=1492, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:50:31,663 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 123 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:31,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 0 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:50:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2025-04-13 17:50:32,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 434. [2025-04-13 17:50:32,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.0854503464203233) internal successors, (1336), 433 states have internal predecessors, (1336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:32,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1336 transitions. [2025-04-13 17:50:32,369 INFO L79 Accepts]: Start accepts. Automaton has 434 states and 1336 transitions. Word has length 29 [2025-04-13 17:50:32,369 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:32,369 INFO L485 AbstractCegarLoop]: Abstraction has 434 states and 1336 transitions. [2025-04-13 17:50:32,369 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 17:50:32,369 INFO L278 IsEmpty]: Start isEmpty. Operand 434 states and 1336 transitions. [2025-04-13 17:50:32,369 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:32,369 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:32,370 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 17:50:32,382 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 17:50:32,570 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable105 [2025-04-13 17:50:32,570 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 17:50:32,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:32,570 INFO L85 PathProgramCache]: Analyzing trace with hash 2112361679, now seen corresponding path program 88 times [2025-04-13 17:50:32,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:32,571 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98180112] [2025-04-13 17:50:32,571 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:32,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:32,582 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:32,585 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 17:50:32,585 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:50:32,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:32,703 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 17:50:32,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:32,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98180112] [2025-04-13 17:50:32,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98180112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:32,703 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [218144952] [2025-04-13 17:50:32,703 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:32,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:32,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:32,705 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 17:50:32,705 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 17:50:33,017 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:33,025 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 16 of 29 statements. [2025-04-13 17:50:33,025 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:50:33,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:33,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:50:33,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:33,118 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 17:50:33,118 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:33,312 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 17:50:33,312 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 17:50:33,454 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 17:50:33,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [218144952] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:33,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:33,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-04-13 17:50:33,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665890204] [2025-04-13 17:50:33,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:33,455 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 17:50:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:33,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 17:50:33,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2025-04-13 17:50:33,455 INFO L87 Difference]: Start difference. First operand 434 states and 1336 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:36,442 INFO L93 Difference]: Finished difference Result 706 states and 1957 transitions. [2025-04-13 17:50:36,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:50:36,443 INFO L79 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:50:36,443 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:36,444 INFO L225 Difference]: With dead ends: 706 [2025-04-13 17:50:36,444 INFO L226 Difference]: Without dead ends: 692 [2025-04-13 17:50:36,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:50:36,445 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:36,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:50:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2025-04-13 17:50:37,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 440. [2025-04-13 17:50:37,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 3.091116173120729) internal successors, (1357), 439 states have internal predecessors, (1357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1357 transitions. [2025-04-13 17:50:37,169 INFO L79 Accepts]: Start accepts. Automaton has 440 states and 1357 transitions. Word has length 29 [2025-04-13 17:50:37,170 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:37,170 INFO L485 AbstractCegarLoop]: Abstraction has 440 states and 1357 transitions. [2025-04-13 17:50:37,170 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 21 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:37,170 INFO L278 IsEmpty]: Start isEmpty. Operand 440 states and 1357 transitions. [2025-04-13 17:50:37,170 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:37,170 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:37,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 17:50:37,178 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 17:50:37,370 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable106,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:37,371 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 17:50:37,371 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:37,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1284980481, now seen corresponding path program 89 times [2025-04-13 17:50:37,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:37,371 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791385891] [2025-04-13 17:50:37,371 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:50:37,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:37,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:37,401 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:37,401 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:50:37,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:50:37,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:37,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791385891] [2025-04-13 17:50:37,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791385891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:37,960 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54112763] [2025-04-13 17:50:37,960 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:50:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:37,962 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 17:50:37,963 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 17:50:38,275 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:38,346 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:38,346 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:50:38,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:38,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:50:38,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:38,508 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 17:50:38,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:38,598 INFO L325 Elim1Store]: treesize reduction 11, result has 86.7 percent of original size [2025-04-13 17:50:38,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 50 treesize of output 87 [2025-04-13 17:50:38,690 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 17:50:38,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54112763] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:38,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:38,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 9] total 35 [2025-04-13 17:50:38,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408942001] [2025-04-13 17:50:38,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:38,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 17:50:38,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:38,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 17:50:38,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1070, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:50:38,692 INFO L87 Difference]: Start difference. First operand 440 states and 1357 transitions. Second operand has 35 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 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 17:50:40,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:40,521 INFO L93 Difference]: Finished difference Result 480 states and 1454 transitions. [2025-04-13 17:50:40,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 17:50:40,521 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 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 29 [2025-04-13 17:50:40,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:40,522 INFO L225 Difference]: With dead ends: 480 [2025-04-13 17:50:40,522 INFO L226 Difference]: Without dead ends: 472 [2025-04-13 17:50:40,522 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=268, Invalid=2282, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:50:40,523 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 95 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:40,523 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 0 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:50:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-04-13 17:50:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 434. [2025-04-13 17:50:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 3.07621247113164) internal successors, (1332), 433 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1332 transitions. [2025-04-13 17:50:41,246 INFO L79 Accepts]: Start accepts. Automaton has 434 states and 1332 transitions. Word has length 29 [2025-04-13 17:50:41,246 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:41,246 INFO L485 AbstractCegarLoop]: Abstraction has 434 states and 1332 transitions. [2025-04-13 17:50:41,246 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 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 17:50:41,246 INFO L278 IsEmpty]: Start isEmpty. Operand 434 states and 1332 transitions. [2025-04-13 17:50:41,247 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:41,247 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:41,247 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 17:50:41,255 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 17:50:41,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable107 [2025-04-13 17:50:41,447 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 17:50:41,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash 435412506, now seen corresponding path program 90 times [2025-04-13 17:50:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:41,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089804995] [2025-04-13 17:50:41,448 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:50:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:41,458 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:41,473 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:41,473 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:50:41,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:41,754 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 17:50:41,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:41,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089804995] [2025-04-13 17:50:41,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089804995] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:41,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668833413] [2025-04-13 17:50:41,755 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:50:41,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:41,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:41,756 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 17:50:41,757 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 17:50:42,072 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:42,103 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:42,103 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:50:42,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:42,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:50:42,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:42,256 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 17:50:42,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:42,442 INFO L325 Elim1Store]: treesize reduction 43, result has 72.4 percent of original size [2025-04-13 17:50:42,443 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 62 treesize of output 128 [2025-04-13 17:50:42,507 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 17:50:42,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668833413] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:42,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:42,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 17:50:42,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871982128] [2025-04-13 17:50:42,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:42,508 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:50:42,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:42,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:50:42,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:50:42,508 INFO L87 Difference]: Start difference. First operand 434 states and 1332 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 17:50:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:44,576 INFO L93 Difference]: Finished difference Result 582 states and 1678 transitions. [2025-04-13 17:50:44,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 17:50:44,576 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 17:50:44,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:44,578 INFO L225 Difference]: With dead ends: 582 [2025-04-13 17:50:44,578 INFO L226 Difference]: Without dead ends: 569 [2025-04-13 17:50:44,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 17:50:44,578 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 94 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:44,578 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 0 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:50:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-04-13 17:50:45,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 430. [2025-04-13 17:50:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.058275058275058) internal successors, (1312), 429 states have internal predecessors, (1312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:45,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1312 transitions. [2025-04-13 17:50:45,315 INFO L79 Accepts]: Start accepts. Automaton has 430 states and 1312 transitions. Word has length 29 [2025-04-13 17:50:45,315 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:45,315 INFO L485 AbstractCegarLoop]: Abstraction has 430 states and 1312 transitions. [2025-04-13 17:50:45,315 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 17:50:45,315 INFO L278 IsEmpty]: Start isEmpty. Operand 430 states and 1312 transitions. [2025-04-13 17:50:45,316 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:45,316 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:45,316 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 17:50:45,324 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 17:50:45,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:45,516 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 17:50:45,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash 521299959, now seen corresponding path program 91 times [2025-04-13 17:50:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:45,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313652425] [2025-04-13 17:50:45,517 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:50:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:45,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:50:45,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:45,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:45,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:45,946 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 17:50:45,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:45,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313652425] [2025-04-13 17:50:45,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313652425] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:45,947 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153807887] [2025-04-13 17:50:45,947 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:50:45,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:45,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:45,949 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 17:50:45,949 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 17:50:46,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 17:50:46,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:46,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:50:46,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:46,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 17:50:46,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:46,394 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 17:50:46,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:46,634 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 17:50:46,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 17:50:46,759 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 17:50:46,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153807887] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:46,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:46,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2025-04-13 17:50:46,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881672233] [2025-04-13 17:50:46,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:46,760 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:50:46,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:46,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:50:46,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:50:46,760 INFO L87 Difference]: Start difference. First operand 430 states and 1312 transitions. Second operand has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 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 17:50:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:49,836 INFO L93 Difference]: Finished difference Result 594 states and 1726 transitions. [2025-04-13 17:50:49,836 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-04-13 17:50:49,836 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 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 17:50:49,836 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:49,838 INFO L225 Difference]: With dead ends: 594 [2025-04-13 17:50:49,838 INFO L226 Difference]: Without dead ends: 583 [2025-04-13 17:50:49,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=462, Invalid=3570, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 17:50:49,838 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:49,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 0 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:50:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-04-13 17:50:50,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 432. [2025-04-13 17:50:50,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 3.0556844547563804) internal successors, (1317), 431 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1317 transitions. [2025-04-13 17:50:50,595 INFO L79 Accepts]: Start accepts. Automaton has 432 states and 1317 transitions. Word has length 29 [2025-04-13 17:50:50,595 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:50,595 INFO L485 AbstractCegarLoop]: Abstraction has 432 states and 1317 transitions. [2025-04-13 17:50:50,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 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 17:50:50,595 INFO L278 IsEmpty]: Start isEmpty. Operand 432 states and 1317 transitions. [2025-04-13 17:50:50,596 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:50,596 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:50,596 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 17:50:50,604 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 17:50:50,796 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:50,796 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 17:50:50,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1197043747, now seen corresponding path program 92 times [2025-04-13 17:50:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:50,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520208883] [2025-04-13 17:50:50,796 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:50,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:50,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:50,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:50,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:50:50,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:51,126 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 17:50:51,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:51,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520208883] [2025-04-13 17:50:51,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520208883] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:51,126 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009120282] [2025-04-13 17:50:51,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:50:51,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:51,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:51,128 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 17:50:51,128 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 17:50:51,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-13 17:50:51,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 17:50:51,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:50:51,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:51,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 17:50:51,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:51,656 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 17:50:51,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:51,873 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 17:50:51,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 17:50:52,018 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 17:50:52,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009120282] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:52,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:52,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 9] total 31 [2025-04-13 17:50:52,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526285999] [2025-04-13 17:50:52,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:52,018 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 17:50:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:52,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 17:50:52,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2025-04-13 17:50:52,019 INFO L87 Difference]: Start difference. First operand 432 states and 1317 transitions. Second operand has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:54,499 INFO L93 Difference]: Finished difference Result 547 states and 1598 transitions. [2025-04-13 17:50:54,500 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:50:54,500 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-04-13 17:50:54,500 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:54,501 INFO L225 Difference]: With dead ends: 547 [2025-04-13 17:50:54,501 INFO L226 Difference]: Without dead ends: 539 [2025-04-13 17:50:54,501 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=425, Invalid=2545, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 17:50:54,502 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:54,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 17:50:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-04-13 17:50:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 424. [2025-04-13 17:50:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 3.037825059101655) internal successors, (1285), 423 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1285 transitions. [2025-04-13 17:50:55,215 INFO L79 Accepts]: Start accepts. Automaton has 424 states and 1285 transitions. Word has length 29 [2025-04-13 17:50:55,215 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:55,215 INFO L485 AbstractCegarLoop]: Abstraction has 424 states and 1285 transitions. [2025-04-13 17:50:55,215 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.8387096774193548) internal successors, (57), 31 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:55,215 INFO L278 IsEmpty]: Start isEmpty. Operand 424 states and 1285 transitions. [2025-04-13 17:50:55,216 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-04-13 17:50:55,216 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:55,216 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 17:50:55,224 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 17:50:55,416 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:55,416 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 17:50:55,417 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:55,417 INFO L85 PathProgramCache]: Analyzing trace with hash 52718911, now seen corresponding path program 93 times [2025-04-13 17:50:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:55,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134767867] [2025-04-13 17:50:55,417 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:55,427 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:55,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 17:50:55,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:50:55,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:55,723 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 17:50:55,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:55,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134767867] [2025-04-13 17:50:55,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134767867] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:55,723 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080554323] [2025-04-13 17:50:55,723 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:50:55,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:55,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:55,725 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 17:50:55,725 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 17:50:56,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 4 equivalence classes. [2025-04-13 17:50:56,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 27 of 29 statements. [2025-04-13 17:50:56,073 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:50:56,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:56,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-13 17:50:56,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:56,217 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 17:50:56,218 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:50:56,396 INFO L325 Elim1Store]: treesize reduction 22, result has 85.9 percent of original size [2025-04-13 17:50:56,397 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 63 treesize of output 150 [2025-04-13 17:50:56,572 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 17:50:56,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080554323] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:50:56,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:50:56,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 25 [2025-04-13 17:50:56,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986813914] [2025-04-13 17:50:56,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:50:56,573 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:50:56,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:50:56,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:50:56,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:50:56,573 INFO L87 Difference]: Start difference. First operand 424 states and 1285 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 17:50:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:50:58,239 INFO L93 Difference]: Finished difference Result 499 states and 1470 transitions. [2025-04-13 17:50:58,239 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 17:50:58,239 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 17:50:58,239 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:50:58,241 INFO L225 Difference]: With dead ends: 499 [2025-04-13 17:50:58,241 INFO L226 Difference]: Without dead ends: 491 [2025-04-13 17:50:58,241 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=669, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:50:58,241 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:50:58,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 0 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:50:58,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2025-04-13 17:50:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 424. [2025-04-13 17:50:58,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 423 states have (on average 3.037825059101655) internal successors, (1285), 423 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:50:58,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 1285 transitions. [2025-04-13 17:50:58,958 INFO L79 Accepts]: Start accepts. Automaton has 424 states and 1285 transitions. Word has length 29 [2025-04-13 17:50:58,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:50:58,958 INFO L485 AbstractCegarLoop]: Abstraction has 424 states and 1285 transitions. [2025-04-13 17:50:58,959 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 17:50:58,959 INFO L278 IsEmpty]: Start isEmpty. Operand 424 states and 1285 transitions. [2025-04-13 17:50:58,959 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:50:58,959 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:50:58,959 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 17:50:58,967 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 17:50:59,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2025-04-13 17:50:59,160 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 17:50:59,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:50:59,160 INFO L85 PathProgramCache]: Analyzing trace with hash -680517620, now seen corresponding path program 94 times [2025-04-13 17:50:59,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:50:59,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674472246] [2025-04-13 17:50:59,160 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:50:59,171 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:50:59,175 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:50:59,175 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:50:59,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:59,458 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 17:50:59,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:50:59,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674472246] [2025-04-13 17:50:59,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674472246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:50:59,459 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741726780] [2025-04-13 17:50:59,459 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:50:59,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:50:59,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:50:59,460 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 17:50:59,461 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 17:50:59,783 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:50:59,792 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:50:59,792 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:50:59,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:50:59,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 17:50:59,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:50:59,976 INFO L325 Elim1Store]: treesize reduction 15, result has 71.7 percent of original size [2025-04-13 17:50:59,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 97 treesize of output 78 [2025-04-13 17:51:00,005 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 17:51:00,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:00,354 INFO L325 Elim1Store]: treesize reduction 11, result has 92.9 percent of original size [2025-04-13 17:51:00,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 196 treesize of output 260 [2025-04-13 17:51:01,315 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 17:51:01,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741726780] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:01,316 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:01,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2025-04-13 17:51:01,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435700402] [2025-04-13 17:51:01,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:01,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 17:51:01,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:01,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 17:51:01,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2025-04-13 17:51:01,316 INFO L87 Difference]: Start difference. First operand 424 states and 1285 transitions. Second operand has 26 states, 25 states have (on average 1.68) internal successors, (42), 26 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 17:51:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:03,823 INFO L93 Difference]: Finished difference Result 556 states and 1628 transitions. [2025-04-13 17:51:03,823 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 17:51:03,823 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:51:03,823 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:03,824 INFO L225 Difference]: With dead ends: 556 [2025-04-13 17:51:03,825 INFO L226 Difference]: Without dead ends: 527 [2025-04-13 17:51:03,825 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 17:51:03,825 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:03,825 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:51:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-04-13 17:51:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 428. [2025-04-13 17:51:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 3.030444964871194) internal successors, (1294), 427 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1294 transitions. [2025-04-13 17:51:04,547 INFO L79 Accepts]: Start accepts. Automaton has 428 states and 1294 transitions. Word has length 30 [2025-04-13 17:51:04,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:04,547 INFO L485 AbstractCegarLoop]: Abstraction has 428 states and 1294 transitions. [2025-04-13 17:51:04,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.68) internal successors, (42), 26 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 17:51:04,547 INFO L278 IsEmpty]: Start isEmpty. Operand 428 states and 1294 transitions. [2025-04-13 17:51:04,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:51:04,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:04,548 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 17:51:04,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2025-04-13 17:51:04,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable112,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:04,748 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 17:51:04,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash -2115960238, now seen corresponding path program 95 times [2025-04-13 17:51:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:04,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857801282] [2025-04-13 17:51:04,749 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:51:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:04,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:51:04,777 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:51:04,777 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:51:04,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:51:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:05,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857801282] [2025-04-13 17:51:05,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857801282] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:05,237 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116828976] [2025-04-13 17:51:05,237 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:51:05,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:05,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:05,239 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 17:51:05,239 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 17:51:05,584 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:51:05,631 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:51:05,631 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:51:05,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:05,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:51:05,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:06,000 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:51:06,000 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:51:06,028 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 17:51:06,028 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:06,265 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:06,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 195 treesize of output 193 [2025-04-13 17:51:06,567 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 17:51:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116828976] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:06,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:06,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 35 [2025-04-13 17:51:06,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890818858] [2025-04-13 17:51:06,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:06,568 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:51:06,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:06,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:51:06,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:51:06,568 INFO L87 Difference]: Start difference. First operand 428 states and 1294 transitions. Second operand has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:09,158 INFO L93 Difference]: Finished difference Result 549 states and 1614 transitions. [2025-04-13 17:51:09,158 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-04-13 17:51:09,158 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:51:09,158 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:09,160 INFO L225 Difference]: With dead ends: 549 [2025-04-13 17:51:09,160 INFO L226 Difference]: Without dead ends: 525 [2025-04-13 17:51:09,160 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=2919, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 17:51:09,160 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 157 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:09,160 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 0 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:51:09,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2025-04-13 17:51:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 430. [2025-04-13 17:51:09,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 429 states have (on average 3.027972027972028) internal successors, (1299), 429 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1299 transitions. [2025-04-13 17:51:09,894 INFO L79 Accepts]: Start accepts. Automaton has 430 states and 1299 transitions. Word has length 30 [2025-04-13 17:51:09,894 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:09,894 INFO L485 AbstractCegarLoop]: Abstraction has 430 states and 1299 transitions. [2025-04-13 17:51:09,894 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:09,894 INFO L278 IsEmpty]: Start isEmpty. Operand 430 states and 1299 transitions. [2025-04-13 17:51:09,894 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:51:09,894 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:09,894 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 17:51:09,903 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 17:51:10,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:10,099 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 17:51:10,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:10,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1263626814, now seen corresponding path program 96 times [2025-04-13 17:51:10,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:10,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362324219] [2025-04-13 17:51:10,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:51:10,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:10,110 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:51:10,127 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:51:10,127 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:51:10,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:10,553 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 17:51:10,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:10,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362324219] [2025-04-13 17:51:10,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362324219] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:10,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671498651] [2025-04-13 17:51:10,554 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:51:10,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:10,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:10,556 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 17:51:10,556 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 17:51:10,884 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:51:10,917 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:51:10,918 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:51:10,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:10,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:51:10,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:11,104 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:51:11,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:51:11,123 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 17:51:11,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:11,283 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:11,284 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:51:11,821 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 17:51:11,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671498651] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:11,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:11,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 28 [2025-04-13 17:51:11,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863468497] [2025-04-13 17:51:11,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:11,821 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 17:51:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:11,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 17:51:11,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-04-13 17:51:11,822 INFO L87 Difference]: Start difference. First operand 430 states and 1299 transitions. Second operand has 29 states, 28 states have (on average 1.7857142857142858) 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 17:51:15,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:15,079 INFO L93 Difference]: Finished difference Result 608 states and 1768 transitions. [2025-04-13 17:51:15,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 17:51:15,079 INFO L79 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.7857142857142858) 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 30 [2025-04-13 17:51:15,079 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:15,080 INFO L225 Difference]: With dead ends: 608 [2025-04-13 17:51:15,080 INFO L226 Difference]: Without dead ends: 583 [2025-04-13 17:51:15,081 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=412, Invalid=3370, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 17:51:15,081 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 162 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:15,081 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 0 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:51:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2025-04-13 17:51:15,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 441. [2025-04-13 17:51:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 3.022727272727273) internal successors, (1330), 440 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:15,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 1330 transitions. [2025-04-13 17:51:15,869 INFO L79 Accepts]: Start accepts. Automaton has 441 states and 1330 transitions. Word has length 30 [2025-04-13 17:51:15,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:15,869 INFO L485 AbstractCegarLoop]: Abstraction has 441 states and 1330 transitions. [2025-04-13 17:51:15,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.7857142857142858) 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 17:51:15,869 INFO L278 IsEmpty]: Start isEmpty. Operand 441 states and 1330 transitions. [2025-04-13 17:51:15,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:51:15,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:15,869 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 17:51:15,877 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 17:51:16,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2025-04-13 17:51:16,070 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 17:51:16,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash 287888466, now seen corresponding path program 97 times [2025-04-13 17:51:16,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:16,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882312116] [2025-04-13 17:51:16,070 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:51:16,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:16,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:51:16,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:51:16,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:51:16,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:16,662 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 17:51:16,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:16,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882312116] [2025-04-13 17:51:16,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882312116] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:16,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641818626] [2025-04-13 17:51:16,662 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:51:16,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:16,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:16,664 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 17:51:16,664 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 17:51:17,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:51:17,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:51:17,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:51:17,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:17,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:51:17,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:17,261 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:51:17,262 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:51:17,286 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 17:51:17,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:17,500 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:51:17,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 214 treesize of output 212 [2025-04-13 17:51:18,078 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 17:51:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641818626] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:18,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 17:51:18,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921393421] [2025-04-13 17:51:18,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:18,079 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:51:18,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:18,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:51:18,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1429, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:51:18,079 INFO L87 Difference]: Start difference. First operand 441 states and 1330 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:23,667 INFO L93 Difference]: Finished difference Result 723 states and 2009 transitions. [2025-04-13 17:51:23,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-13 17:51:23,667 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:51:23,667 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:23,669 INFO L225 Difference]: With dead ends: 723 [2025-04-13 17:51:23,669 INFO L226 Difference]: Without dead ends: 685 [2025-04-13 17:51:23,669 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3576 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1192, Invalid=11918, Unknown=0, NotChecked=0, Total=13110 [2025-04-13 17:51:23,669 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 301 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:23,669 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 0 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 17:51:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-04-13 17:51:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 463. [2025-04-13 17:51:24,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 3.036796536796537) internal successors, (1403), 462 states have internal predecessors, (1403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 1403 transitions. [2025-04-13 17:51:24,547 INFO L79 Accepts]: Start accepts. Automaton has 463 states and 1403 transitions. Word has length 30 [2025-04-13 17:51:24,547 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:24,547 INFO L485 AbstractCegarLoop]: Abstraction has 463 states and 1403 transitions. [2025-04-13 17:51:24,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:24,547 INFO L278 IsEmpty]: Start isEmpty. Operand 463 states and 1403 transitions. [2025-04-13 17:51:24,548 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:51:24,548 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:24,548 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 17:51:24,556 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 17:51:24,748 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2025-04-13 17:51:24,748 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 17:51:24,748 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:24,749 INFO L85 PathProgramCache]: Analyzing trace with hash 337937346, now seen corresponding path program 98 times [2025-04-13 17:51:24,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:24,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536450526] [2025-04-13 17:51:24,749 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:51:24,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:24,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:51:24,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:51:24,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:51:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:25,278 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 17:51:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:25,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536450526] [2025-04-13 17:51:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536450526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:25,278 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570933284] [2025-04-13 17:51:25,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:51:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:25,280 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 17:51:25,281 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 17:51:25,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:51:25,636 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:51:25,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:51:25,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:25,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-04-13 17:51:25,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:25,989 INFO L325 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2025-04-13 17:51:25,989 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 97 treesize of output 53 [2025-04-13 17:51:26,012 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 17:51:26,012 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:26,798 INFO L325 Elim1Store]: treesize reduction 45, result has 84.7 percent of original size [2025-04-13 17:51:26,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 150 treesize of output 299 [2025-04-13 17:51:30,091 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 17:51:30,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570933284] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:30,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:30,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 17:51:30,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984923192] [2025-04-13 17:51:30,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:30,092 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:51:30,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:30,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:51:30,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1395, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:51:30,092 INFO L87 Difference]: Start difference. First operand 463 states and 1403 transitions. Second operand has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:51:53,028 INFO L93 Difference]: Finished difference Result 1221 states and 3170 transitions. [2025-04-13 17:51:53,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2025-04-13 17:51:53,029 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:51:53,029 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:51:53,031 INFO L225 Difference]: With dead ends: 1221 [2025-04-13 17:51:53,031 INFO L226 Difference]: Without dead ends: 1165 [2025-04-13 17:51:53,033 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14713 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=4196, Invalid=35604, Unknown=0, NotChecked=0, Total=39800 [2025-04-13 17:51:53,033 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 929 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3909 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 3909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:51:53,033 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 0 Invalid, 4039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 3909 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 17:51:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2025-04-13 17:51:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 517. [2025-04-13 17:51:54,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 3.102713178294574) internal successors, (1601), 516 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:54,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1601 transitions. [2025-04-13 17:51:54,076 INFO L79 Accepts]: Start accepts. Automaton has 517 states and 1601 transitions. Word has length 30 [2025-04-13 17:51:54,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:51:54,076 INFO L485 AbstractCegarLoop]: Abstraction has 517 states and 1601 transitions. [2025-04-13 17:51:54,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 40 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:51:54,076 INFO L278 IsEmpty]: Start isEmpty. Operand 517 states and 1601 transitions. [2025-04-13 17:51:54,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:51:54,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:51:54,077 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 17:51:54,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2025-04-13 17:51:54,277 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:54,277 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 17:51:54,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:51:54,278 INFO L85 PathProgramCache]: Analyzing trace with hash 340474386, now seen corresponding path program 99 times [2025-04-13 17:51:54,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:51:54,278 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212034875] [2025-04-13 17:51:54,278 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:51:54,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:51:54,289 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:51:54,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 17:51:54,304 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:51:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:54,709 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 17:51:54,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:51:54,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212034875] [2025-04-13 17:51:54,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212034875] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:51:54,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400487111] [2025-04-13 17:51:54,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:51:54,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:51:54,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:51:54,711 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 17:51:54,712 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 17:51:55,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:51:55,074 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 17:51:55,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:51:55,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:51:55,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-13 17:51:55,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:51:55,441 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:51:55,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:51:55,466 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 17:51:55,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:51:56,067 INFO L325 Elim1Store]: treesize reduction 11, result has 93.1 percent of original size [2025-04-13 17:51:56,067 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 178 treesize of output 214 [2025-04-13 17:51:57,663 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 17:51:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400487111] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:51:57,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:51:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 17:51:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747907159] [2025-04-13 17:51:57,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:51:57,664 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:51:57,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:51:57,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:51:57,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1173, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:51:57,664 INFO L87 Difference]: Start difference. First operand 517 states and 1601 transitions. Second operand has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:04,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:52:04,720 INFO L93 Difference]: Finished difference Result 831 states and 2362 transitions. [2025-04-13 17:52:04,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 17:52:04,721 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:52:04,721 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:52:04,722 INFO L225 Difference]: With dead ends: 831 [2025-04-13 17:52:04,723 INFO L226 Difference]: Without dead ends: 798 [2025-04-13 17:52:04,723 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2788 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1085, Invalid=8035, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 17:52:04,723 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 344 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:04,723 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 0 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:52:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-04-13 17:52:05,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 543. [2025-04-13 17:52:05,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 542 states have (on average 3.132841328413284) internal successors, (1698), 542 states have internal predecessors, (1698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1698 transitions. [2025-04-13 17:52:05,896 INFO L79 Accepts]: Start accepts. Automaton has 543 states and 1698 transitions. Word has length 30 [2025-04-13 17:52:05,896 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:52:05,896 INFO L485 AbstractCegarLoop]: Abstraction has 543 states and 1698 transitions. [2025-04-13 17:52:05,896 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:05,896 INFO L278 IsEmpty]: Start isEmpty. Operand 543 states and 1698 transitions. [2025-04-13 17:52:05,897 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:52:05,897 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:52:05,897 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 17:52:05,904 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 17:52:06,097 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:06,097 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 17:52:06,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:52:06,098 INFO L85 PathProgramCache]: Analyzing trace with hash -810521064, now seen corresponding path program 100 times [2025-04-13 17:52:06,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:52:06,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517182221] [2025-04-13 17:52:06,098 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:52:06,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:52:06,120 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:52:06,124 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:52:06,124 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:52:06,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:06,398 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 17:52:06,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:52:06,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517182221] [2025-04-13 17:52:06,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517182221] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:52:06,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565753986] [2025-04-13 17:52:06,398 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:52:06,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:06,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:52:06,400 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 17:52:06,401 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 17:52:06,746 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:52:06,755 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:52:06,755 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:52:06,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:06,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:52:06,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:52:06,924 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:52:06,925 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:52:06,946 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 17:52:06,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:52:07,150 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:52:07,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 199 treesize of output 197 [2025-04-13 17:52:07,609 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 17:52:07,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565753986] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:52:07,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:52:07,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2025-04-13 17:52:07,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938606954] [2025-04-13 17:52:07,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:52:07,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 17:52:07,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:52:07,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 17:52:07,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2025-04-13 17:52:07,610 INFO L87 Difference]: Start difference. First operand 543 states and 1698 transitions. Second operand has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 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 17:52:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:52:10,854 INFO L93 Difference]: Finished difference Result 652 states and 1975 transitions. [2025-04-13 17:52:10,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:52:10,854 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:52:10,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:52:10,856 INFO L225 Difference]: With dead ends: 652 [2025-04-13 17:52:10,856 INFO L226 Difference]: Without dead ends: 624 [2025-04-13 17:52:10,856 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=187, Invalid=1705, Unknown=0, NotChecked=0, Total=1892 [2025-04-13 17:52:10,856 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1672 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:10,856 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:52:10,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-04-13 17:52:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 550. [2025-04-13 17:52:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.120218579234973) internal successors, (1713), 549 states have internal predecessors, (1713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:12,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1713 transitions. [2025-04-13 17:52:12,060 INFO L79 Accepts]: Start accepts. Automaton has 550 states and 1713 transitions. Word has length 30 [2025-04-13 17:52:12,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:52:12,060 INFO L485 AbstractCegarLoop]: Abstraction has 550 states and 1713 transitions. [2025-04-13 17:52:12,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 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 17:52:12,060 INFO L278 IsEmpty]: Start isEmpty. Operand 550 states and 1713 transitions. [2025-04-13 17:52:12,061 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:52:12,061 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:52:12,061 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 17:52:12,069 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 17:52:12,261 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2025-04-13 17:52:12,262 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 17:52:12,262 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:52:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2019047442, now seen corresponding path program 101 times [2025-04-13 17:52:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:52:12,262 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658637754] [2025-04-13 17:52:12,262 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:52:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:52:12,273 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:52:12,286 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:52:12,286 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:52:12,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:52:12,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:52:12,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658637754] [2025-04-13 17:52:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658637754] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:52:12,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968599748] [2025-04-13 17:52:12,761 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:52:12,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:12,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:52:12,762 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 17:52:12,763 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 17:52:13,105 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:52:13,146 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:52:13,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:52:13,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:13,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:52:13,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:52:13,416 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:52:13,416 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:52:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-13 17:52:13,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:52:13,636 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:52:13,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:52:14,154 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 17:52:14,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968599748] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:52:14,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:52:14,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 33 [2025-04-13 17:52:14,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662147021] [2025-04-13 17:52:14,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:52:14,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 17:52:14,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:52:14,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 17:52:14,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 17:52:14,154 INFO L87 Difference]: Start difference. First operand 550 states and 1713 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 17:52:17,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:52:17,393 INFO L93 Difference]: Finished difference Result 632 states and 1917 transitions. [2025-04-13 17:52:17,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:52:17,393 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 17:52:17,393 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:52:17,395 INFO L225 Difference]: With dead ends: 632 [2025-04-13 17:52:17,395 INFO L226 Difference]: Without dead ends: 607 [2025-04-13 17:52:17,396 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=3106, Unknown=0, NotChecked=0, Total=3422 [2025-04-13 17:52:17,396 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 144 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:17,396 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 0 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:52:17,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-04-13 17:52:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 554. [2025-04-13 17:52:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 553 states have (on average 3.115732368896926) internal successors, (1723), 553 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:18,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 1723 transitions. [2025-04-13 17:52:18,639 INFO L79 Accepts]: Start accepts. Automaton has 554 states and 1723 transitions. Word has length 30 [2025-04-13 17:52:18,639 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:52:18,639 INFO L485 AbstractCegarLoop]: Abstraction has 554 states and 1723 transitions. [2025-04-13 17:52:18,639 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 17:52:18,639 INFO L278 IsEmpty]: Start isEmpty. Operand 554 states and 1723 transitions. [2025-04-13 17:52:18,640 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:52:18,640 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:52:18,640 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 17:52:18,648 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 17:52:18,840 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:18,840 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 17:52:18,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:52:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash 2098387800, now seen corresponding path program 102 times [2025-04-13 17:52:18,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:52:18,841 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848986708] [2025-04-13 17:52:18,841 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:52:18,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:52:18,852 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:52:18,870 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:52:18,870 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:52:18,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:19,405 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 17:52:19,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:52:19,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848986708] [2025-04-13 17:52:19,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848986708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:52:19,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791786418] [2025-04-13 17:52:19,405 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:52:19,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:19,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:52:19,407 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 17:52:19,408 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 17:52:19,757 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:52:19,787 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:52:19,787 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:52:19,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:19,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:52:19,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:52:20,096 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:52:20,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:52:20,124 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 17:52:20,124 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:52:20,587 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 17:52:20,588 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 239 [2025-04-13 17:52:22,193 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 17:52:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791786418] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:52:22,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:52:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 17:52:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755784630] [2025-04-13 17:52:22,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:52:22,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:52:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:52:22,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:52:22,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:52:22,194 INFO L87 Difference]: Start difference. First operand 554 states and 1723 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:52:29,364 INFO L93 Difference]: Finished difference Result 800 states and 2297 transitions. [2025-04-13 17:52:29,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 17:52:29,365 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:52:29,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:52:29,367 INFO L225 Difference]: With dead ends: 800 [2025-04-13 17:52:29,367 INFO L226 Difference]: Without dead ends: 768 [2025-04-13 17:52:29,367 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3373 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1104, Invalid=10026, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 17:52:29,368 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:29,368 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:52:29,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-04-13 17:52:30,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 572. [2025-04-13 17:52:30,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 571 states have (on average 3.1138353765323994) internal successors, (1778), 571 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:30,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1778 transitions. [2025-04-13 17:52:30,673 INFO L79 Accepts]: Start accepts. Automaton has 572 states and 1778 transitions. Word has length 30 [2025-04-13 17:52:30,673 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:52:30,673 INFO L485 AbstractCegarLoop]: Abstraction has 572 states and 1778 transitions. [2025-04-13 17:52:30,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:30,673 INFO L278 IsEmpty]: Start isEmpty. Operand 572 states and 1778 transitions. [2025-04-13 17:52:30,674 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:52:30,674 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:52:30,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 17:52:30,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Forceful destruction successful, exit code 0 [2025-04-13 17:52:30,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:30,874 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 17:52:30,874 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:52:30,875 INFO L85 PathProgramCache]: Analyzing trace with hash 430092974, now seen corresponding path program 103 times [2025-04-13 17:52:30,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:52:30,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129334268] [2025-04-13 17:52:30,875 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:52:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:52:30,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:52:30,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:52:30,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:52:30,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:31,525 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 17:52:31,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:52:31,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129334268] [2025-04-13 17:52:31,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129334268] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:52:31,525 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030712781] [2025-04-13 17:52:31,525 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:52:31,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:52:31,527 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 17:52:31,528 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 17:52:31,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:52:31,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:52:31,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:52:31,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:31,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:52:31,908 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:52:32,093 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:52:32,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:52:32,117 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 17:52:32,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:52:32,236 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:52:32,236 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 195 treesize of output 191 [2025-04-13 17:52:32,842 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 17:52:32,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030712781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:52:32,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:52:32,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 35 [2025-04-13 17:52:32,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369731275] [2025-04-13 17:52:32,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:52:32,843 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:52:32,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:52:32,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:52:32,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:52:32,843 INFO L87 Difference]: Start difference. First operand 572 states and 1778 transitions. Second operand has 36 states, 35 states have (on average 1.6) 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 17:52:37,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:52:37,441 INFO L93 Difference]: Finished difference Result 785 states and 2252 transitions. [2025-04-13 17:52:37,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 17:52:37,442 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6) 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 30 [2025-04-13 17:52:37,442 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:52:37,444 INFO L225 Difference]: With dead ends: 785 [2025-04-13 17:52:37,444 INFO L226 Difference]: Without dead ends: 745 [2025-04-13 17:52:37,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=606, Invalid=6534, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 17:52:37,444 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:37,444 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:52:37,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-04-13 17:52:38,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 592. [2025-04-13 17:52:38,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 591 states have (on average 3.1235194585448394) internal successors, (1846), 591 states have internal predecessors, (1846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:38,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 1846 transitions. [2025-04-13 17:52:38,800 INFO L79 Accepts]: Start accepts. Automaton has 592 states and 1846 transitions. Word has length 30 [2025-04-13 17:52:38,800 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:52:38,800 INFO L485 AbstractCegarLoop]: Abstraction has 592 states and 1846 transitions. [2025-04-13 17:52:38,800 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6) 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 17:52:38,800 INFO L278 IsEmpty]: Start isEmpty. Operand 592 states and 1846 transitions. [2025-04-13 17:52:38,801 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:52:38,801 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:52:38,801 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 17:52:38,809 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 17:52:39,001 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121 [2025-04-13 17:52:39,001 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 17:52:39,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:52:39,002 INFO L85 PathProgramCache]: Analyzing trace with hash 432630014, now seen corresponding path program 104 times [2025-04-13 17:52:39,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:52:39,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80038315] [2025-04-13 17:52:39,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:52:39,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:52:39,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:52:39,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:52:39,024 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:52:39,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:39,404 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 17:52:39,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:52:39,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80038315] [2025-04-13 17:52:39,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80038315] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:52:39,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021394904] [2025-04-13 17:52:39,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:52:39,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:39,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:52:39,407 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 17:52:39,407 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 17:52:39,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:52:39,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:52:39,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:52:39,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:39,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:52:39,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:52:40,140 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:52:40,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:52:40,168 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 17:52:40,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:52:40,273 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:52:40,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:52:41,450 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 17:52:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021394904] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:52:41,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:52:41,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 17:52:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135808499] [2025-04-13 17:52:41,451 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:52:41,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:52:41,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:52:41,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:52:41,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1396, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:52:41,452 INFO L87 Difference]: Start difference. First operand 592 states and 1846 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:52:45,570 INFO L93 Difference]: Finished difference Result 758 states and 2165 transitions. [2025-04-13 17:52:45,571 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 17:52:45,571 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:52:45,571 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:52:45,573 INFO L225 Difference]: With dead ends: 758 [2025-04-13 17:52:45,573 INFO L226 Difference]: Without dead ends: 712 [2025-04-13 17:52:45,573 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=722, Invalid=6934, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 17:52:45,573 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 231 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:45,573 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 0 Invalid, 1713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:52:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-04-13 17:52:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 568. [2025-04-13 17:52:46,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 3.0864197530864197) internal successors, (1750), 567 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1750 transitions. [2025-04-13 17:52:46,869 INFO L79 Accepts]: Start accepts. Automaton has 568 states and 1750 transitions. Word has length 30 [2025-04-13 17:52:46,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:52:46,869 INFO L485 AbstractCegarLoop]: Abstraction has 568 states and 1750 transitions. [2025-04-13 17:52:46,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:46,869 INFO L278 IsEmpty]: Start isEmpty. Operand 568 states and 1750 transitions. [2025-04-13 17:52:46,869 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:52:46,869 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:52:46,869 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 17:52:46,878 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 17:52:47,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable122,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:47,070 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 17:52:47,070 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:52:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 543452534, now seen corresponding path program 105 times [2025-04-13 17:52:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:52:47,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001327470] [2025-04-13 17:52:47,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:52:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:52:47,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:52:47,100 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 17:52:47,100 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:52:47,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:47,587 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 17:52:47,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:52:47,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001327470] [2025-04-13 17:52:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001327470] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:52:47,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360337408] [2025-04-13 17:52:47,587 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:52:47,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:47,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:52:47,589 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 17:52:47,589 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 17:52:47,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:52:47,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 17:52:47,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:52:47,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:47,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:52:47,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:52:48,161 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:52:48,161 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:52:48,184 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 17:52:48,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:52:48,314 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:52:48,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:52:48,820 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 17:52:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360337408] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:52:48,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:52:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 17:52:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287631875] [2025-04-13 17:52:48,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:52:48,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 17:52:48,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:52:48,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 17:52:48,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2025-04-13 17:52:48,821 INFO L87 Difference]: Start difference. First operand 568 states and 1750 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 17:52:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:52:52,622 INFO L93 Difference]: Finished difference Result 678 states and 1993 transitions. [2025-04-13 17:52:52,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 17:52:52,622 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 17:52:52,622 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:52:52,624 INFO L225 Difference]: With dead ends: 678 [2025-04-13 17:52:52,624 INFO L226 Difference]: Without dead ends: 655 [2025-04-13 17:52:52,624 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=464, Invalid=3958, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:52:52,624 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:52,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 0 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:52:52,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2025-04-13 17:52:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 568. [2025-04-13 17:52:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 3.075837742504409) internal successors, (1744), 567 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:52:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1744 transitions. [2025-04-13 17:52:53,932 INFO L79 Accepts]: Start accepts. Automaton has 568 states and 1744 transitions. Word has length 30 [2025-04-13 17:52:53,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:52:53,932 INFO L485 AbstractCegarLoop]: Abstraction has 568 states and 1744 transitions. [2025-04-13 17:52:53,932 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 17:52:53,933 INFO L278 IsEmpty]: Start isEmpty. Operand 568 states and 1744 transitions. [2025-04-13 17:52:53,933 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:52:53,933 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:52:53,933 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 17:52:53,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Forceful destruction successful, exit code 0 [2025-04-13 17:52:54,133 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2025-04-13 17:52:54,134 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 17:52:54,134 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:52:54,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1003387666, now seen corresponding path program 106 times [2025-04-13 17:52:54,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:52:54,134 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166038605] [2025-04-13 17:52:54,134 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:52:54,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:52:54,148 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:52:54,152 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:52:54,152 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:52:54,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:54,410 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 17:52:54,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:52:54,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166038605] [2025-04-13 17:52:54,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166038605] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:52:54,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140343303] [2025-04-13 17:52:54,410 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:52:54,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:52:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:52:54,412 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 17:52:54,413 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 17:52:54,782 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:52:54,791 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:52:54,791 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:52:54,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:52:54,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:52:54,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:52:54,976 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:52:54,976 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:52:54,998 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 17:52:54,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:52:55,202 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:52:55,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 199 treesize of output 197 [2025-04-13 17:52:55,832 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 17:52:55,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140343303] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:52:55,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:52:55,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 17:52:55,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119943601] [2025-04-13 17:52:55,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:52:55,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:52:55,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:52:55,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:52:55,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:52:55,833 INFO L87 Difference]: Start difference. First operand 568 states and 1744 transitions. Second operand has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 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 17:52:59,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:52:59,594 INFO L93 Difference]: Finished difference Result 696 states and 2041 transitions. [2025-04-13 17:52:59,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-13 17:52:59,595 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:52:59,595 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:52:59,596 INFO L225 Difference]: With dead ends: 696 [2025-04-13 17:52:59,596 INFO L226 Difference]: Without dead ends: 646 [2025-04-13 17:52:59,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=2032, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:52:59,597 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 129 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:52:59,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 0 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:52:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2025-04-13 17:53:00,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 571. [2025-04-13 17:53:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 570 states have (on average 3.057894736842105) internal successors, (1743), 570 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 1743 transitions. [2025-04-13 17:53:00,933 INFO L79 Accepts]: Start accepts. Automaton has 571 states and 1743 transitions. Word has length 30 [2025-04-13 17:53:00,933 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:00,933 INFO L485 AbstractCegarLoop]: Abstraction has 571 states and 1743 transitions. [2025-04-13 17:53:00,933 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 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 17:53:00,933 INFO L278 IsEmpty]: Start isEmpty. Operand 571 states and 1743 transitions. [2025-04-13 17:53:00,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:53:00,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:00,934 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 17:53:00,942 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 17:53:01,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2025-04-13 17:53:01,135 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 17:53:01,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash 332716866, now seen corresponding path program 107 times [2025-04-13 17:53:01,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:01,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834887028] [2025-04-13 17:53:01,135 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:53:01,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:01,146 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:53:01,160 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:01,160 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:53:01,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:01,679 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:53:01,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:01,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834887028] [2025-04-13 17:53:01,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834887028] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:01,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117828980] [2025-04-13 17:53:01,680 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:53:01,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:01,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:01,681 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 17:53:01,682 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 17:53:02,046 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:53:02,111 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:02,111 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:53:02,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:02,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 17:53:02,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:02,447 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:53:02,447 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:53:02,482 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 17:53:02,482 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:02,701 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:53:02,701 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:53:03,416 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 17:53:03,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117828980] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:03,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:03,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 11] total 39 [2025-04-13 17:53:03,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176167797] [2025-04-13 17:53:03,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:03,416 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:53:03,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:03,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:53:03,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1435, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:53:03,417 INFO L87 Difference]: Start difference. First operand 571 states and 1743 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:07,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:07,365 INFO L93 Difference]: Finished difference Result 674 states and 1978 transitions. [2025-04-13 17:53:07,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-04-13 17:53:07,365 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:53:07,365 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:07,367 INFO L225 Difference]: With dead ends: 674 [2025-04-13 17:53:07,367 INFO L226 Difference]: Without dead ends: 645 [2025-04-13 17:53:07,367 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1113 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=557, Invalid=5143, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:53:07,367 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:07,367 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:53:07,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-04-13 17:53:08,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 573. [2025-04-13 17:53:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 572 states have (on average 3.055944055944056) internal successors, (1748), 572 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 1748 transitions. [2025-04-13 17:53:08,720 INFO L79 Accepts]: Start accepts. Automaton has 573 states and 1748 transitions. Word has length 30 [2025-04-13 17:53:08,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:08,720 INFO L485 AbstractCegarLoop]: Abstraction has 573 states and 1748 transitions. [2025-04-13 17:53:08,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:08,720 INFO L278 IsEmpty]: Start isEmpty. Operand 573 states and 1748 transitions. [2025-04-13 17:53:08,720 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:53:08,720 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:08,720 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:53:08,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2025-04-13 17:53:08,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable125 [2025-04-13 17:53:08,921 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 17:53:08,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:08,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1905674990, now seen corresponding path program 108 times [2025-04-13 17:53:08,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:08,921 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541049958] [2025-04-13 17:53:08,921 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:53:08,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:08,933 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:53:08,954 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:08,954 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:53:08,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:09,472 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 17:53:09,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:09,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541049958] [2025-04-13 17:53:09,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541049958] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:09,473 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058816908] [2025-04-13 17:53:09,473 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:53:09,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:09,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:09,475 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 17:53:09,475 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 17:53:09,842 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:53:09,874 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:09,874 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:53:09,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:09,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 17:53:09,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:10,142 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:53:10,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:53:10,164 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 17:53:10,164 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:10,314 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:53:10,314 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:53:10,861 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 17:53:10,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058816908] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:10,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:10,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 17:53:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33345071] [2025-04-13 17:53:10,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:10,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:53:10,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:10,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:53:10,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1189, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:53:10,862 INFO L87 Difference]: Start difference. First operand 573 states and 1748 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:14,858 INFO L93 Difference]: Finished difference Result 709 states and 2081 transitions. [2025-04-13 17:53:14,859 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 17:53:14,859 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:53:14,859 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:14,860 INFO L225 Difference]: With dead ends: 709 [2025-04-13 17:53:14,860 INFO L226 Difference]: Without dead ends: 673 [2025-04-13 17:53:14,861 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=478, Invalid=4078, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 17:53:14,861 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1450 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:14,861 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 0 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1450 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:53:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-04-13 17:53:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 579. [2025-04-13 17:53:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 578 states have (on average 3.046712802768166) internal successors, (1761), 578 states have internal predecessors, (1761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:16,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 1761 transitions. [2025-04-13 17:53:16,276 INFO L79 Accepts]: Start accepts. Automaton has 579 states and 1761 transitions. Word has length 30 [2025-04-13 17:53:16,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:16,276 INFO L485 AbstractCegarLoop]: Abstraction has 579 states and 1761 transitions. [2025-04-13 17:53:16,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:16,276 INFO L278 IsEmpty]: Start isEmpty. Operand 579 states and 1761 transitions. [2025-04-13 17:53:16,276 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:53:16,276 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:16,277 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 17:53:16,285 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 17:53:16,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:16,477 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 17:53:16,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1008049854, now seen corresponding path program 109 times [2025-04-13 17:53:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:16,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774177470] [2025-04-13 17:53:16,478 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:53:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:16,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:53:16,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:16,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:53:16,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:17,049 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 17:53:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:17,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774177470] [2025-04-13 17:53:17,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774177470] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:17,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256664568] [2025-04-13 17:53:17,049 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:53:17,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:17,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:17,052 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 17:53:17,052 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 17:53:17,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:53:17,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:17,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:53:17,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:17,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:53:17,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:17,689 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:53:17,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:53:17,712 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 17:53:17,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:17,849 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:53:17,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 17:53: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 17:53:18,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256664568] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:18,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:18,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 17:53:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767729982] [2025-04-13 17:53:18,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:18,409 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:53:18,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:18,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:53:18,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1416, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:53:18,409 INFO L87 Difference]: Start difference. First operand 579 states and 1761 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:22,634 INFO L93 Difference]: Finished difference Result 721 states and 2098 transitions. [2025-04-13 17:53:22,634 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 17:53:22,635 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:53:22,635 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:22,636 INFO L225 Difference]: With dead ends: 721 [2025-04-13 17:53:22,636 INFO L226 Difference]: Without dead ends: 699 [2025-04-13 17:53:22,637 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=692, Invalid=6448, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 17:53:22,637 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:22,637 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:53:22,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-04-13 17:53:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 599. [2025-04-13 17:53:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 3.068561872909699) internal successors, (1835), 598 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1835 transitions. [2025-04-13 17:53:24,096 INFO L79 Accepts]: Start accepts. Automaton has 599 states and 1835 transitions. Word has length 30 [2025-04-13 17:53:24,096 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:24,096 INFO L485 AbstractCegarLoop]: Abstraction has 599 states and 1835 transitions. [2025-04-13 17:53:24,096 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:24,096 INFO L278 IsEmpty]: Start isEmpty. Operand 599 states and 1835 transitions. [2025-04-13 17:53:24,097 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:53:24,097 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:24,097 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 17:53:24,105 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 17:53:24,297 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable127 [2025-04-13 17:53:24,297 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 17:53:24,298 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:24,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1005512814, now seen corresponding path program 110 times [2025-04-13 17:53:24,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:24,298 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309533137] [2025-04-13 17:53:24,298 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:53:24,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:24,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:53:24,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:24,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:53:24,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:24,783 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 17:53:24,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:24,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309533137] [2025-04-13 17:53:24,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309533137] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:24,783 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960922665] [2025-04-13 17:53:24,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:53:24,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:24,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:24,785 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 17:53:24,786 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 17:53:25,157 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:53:25,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:25,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:53:25,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:25,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 17:53:25,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:25,547 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:53:25,547 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:53:25,573 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 17:53:25,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:26,179 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 17:53:26,180 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 209 treesize of output 253 [2025-04-13 17:53:27,966 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 17:53:27,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960922665] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:27,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:27,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 17:53:27,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473616994] [2025-04-13 17:53:27,967 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:27,967 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:53:27,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:27,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:53:27,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1422, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:53:27,968 INFO L87 Difference]: Start difference. First operand 599 states and 1835 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:39,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:39,311 INFO L93 Difference]: Finished difference Result 903 states and 2509 transitions. [2025-04-13 17:53:39,311 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2025-04-13 17:53:39,311 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:53:39,312 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:39,314 INFO L225 Difference]: With dead ends: 903 [2025-04-13 17:53:39,314 INFO L226 Difference]: Without dead ends: 873 [2025-04-13 17:53:39,315 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6030 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1871, Invalid=16761, Unknown=0, NotChecked=0, Total=18632 [2025-04-13 17:53:39,315 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2682 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:39,315 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 2820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2682 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 17:53:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-04-13 17:53:40,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 625. [2025-04-13 17:53:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 3.092948717948718) internal successors, (1930), 624 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1930 transitions. [2025-04-13 17:53:40,901 INFO L79 Accepts]: Start accepts. Automaton has 625 states and 1930 transitions. Word has length 30 [2025-04-13 17:53:40,902 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:40,902 INFO L485 AbstractCegarLoop]: Abstraction has 625 states and 1930 transitions. [2025-04-13 17:53:40,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:40,902 INFO L278 IsEmpty]: Start isEmpty. Operand 625 states and 1930 transitions. [2025-04-13 17:53:40,902 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:53:40,902 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:40,902 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 17:53:40,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2025-04-13 17:53:41,103 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2025-04-13 17:53:41,103 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 17:53:41,103 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:41,103 INFO L85 PathProgramCache]: Analyzing trace with hash -894690294, now seen corresponding path program 111 times [2025-04-13 17:53:41,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:41,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111876345] [2025-04-13 17:53:41,103 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:53:41,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:41,115 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:53:41,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 17:53:41,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:53:41,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:41,526 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 17:53:41,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:41,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111876345] [2025-04-13 17:53:41,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111876345] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:41,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234897518] [2025-04-13 17:53:41,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:53:41,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:41,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:41,528 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 17:53:41,528 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 17:53:41,915 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:53:41,938 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 17:53:41,938 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:53:41,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:41,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:53:41,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:42,252 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:53:42,252 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:53:42,277 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 17:53:42,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:42,413 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:53:42,414 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:53:43,155 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 17:53:43,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234897518] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:43,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:43,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 17:53:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132362777] [2025-04-13 17:53:43,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:43,156 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:53:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:43,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:53:43,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1181, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:53:43,157 INFO L87 Difference]: Start difference. First operand 625 states and 1930 transitions. Second operand has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:47,476 INFO L93 Difference]: Finished difference Result 745 states and 2182 transitions. [2025-04-13 17:53:47,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:53:47,476 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:53:47,476 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:47,478 INFO L225 Difference]: With dead ends: 745 [2025-04-13 17:53:47,478 INFO L226 Difference]: Without dead ends: 697 [2025-04-13 17:53:47,478 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=627, Invalid=5073, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 17:53:47,479 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 199 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:47,479 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 0 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:53:47,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-04-13 17:53:48,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 599. [2025-04-13 17:53:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 3.051839464882943) internal successors, (1825), 598 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:49,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1825 transitions. [2025-04-13 17:53:49,002 INFO L79 Accepts]: Start accepts. Automaton has 599 states and 1825 transitions. Word has length 30 [2025-04-13 17:53:49,002 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:49,002 INFO L485 AbstractCegarLoop]: Abstraction has 599 states and 1825 transitions. [2025-04-13 17:53:49,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:49,002 INFO L278 IsEmpty]: Start isEmpty. Operand 599 states and 1825 transitions. [2025-04-13 17:53:49,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:53:49,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:49,002 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 17:53:49,011 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 17:53:49,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2025-04-13 17:53:49,203 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 17:53:49,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:49,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1754159470, now seen corresponding path program 112 times [2025-04-13 17:53:49,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:49,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544399756] [2025-04-13 17:53:49,203 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:53:49,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:49,215 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:53:49,219 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:53:49,219 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:53:49,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:49,467 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 17:53:49,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:49,467 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544399756] [2025-04-13 17:53:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544399756] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:49,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092945117] [2025-04-13 17:53:49,468 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:53:49,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:49,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:49,469 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 17:53:49,470 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 17:53:49,855 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:53:49,864 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:53:49,864 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:53:49,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:49,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:53:49,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:50,051 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:53:50,051 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:53:50,077 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 17:53:50,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:50,245 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:53:50,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 215 treesize of output 213 [2025-04-13 17:53:50,779 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 17:53:50,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092945117] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:50,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:50,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 17:53:50,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348285474] [2025-04-13 17:53:50,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:50,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:53:50,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:50,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:53:50,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:53:50,780 INFO L87 Difference]: Start difference. First operand 599 states and 1825 transitions. Second operand has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 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 17:53:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:53:54,262 INFO L93 Difference]: Finished difference Result 665 states and 1982 transitions. [2025-04-13 17:53:54,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:53:54,262 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:53:54,262 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:53:54,264 INFO L225 Difference]: With dead ends: 665 [2025-04-13 17:53:54,264 INFO L226 Difference]: Without dead ends: 638 [2025-04-13 17:53:54,264 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=2286, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 17:53:54,264 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 108 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:53:54,264 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 0 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:53:54,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2025-04-13 17:53:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 599. [2025-04-13 17:53:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 598 states have (on average 3.0451505016722407) internal successors, (1821), 598 states have internal predecessors, (1821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:53:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1821 transitions. [2025-04-13 17:53:55,777 INFO L79 Accepts]: Start accepts. Automaton has 599 states and 1821 transitions. Word has length 30 [2025-04-13 17:53:55,778 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:53:55,778 INFO L485 AbstractCegarLoop]: Abstraction has 599 states and 1821 transitions. [2025-04-13 17:53:55,778 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 27 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 17:53:55,778 INFO L278 IsEmpty]: Start isEmpty. Operand 599 states and 1821 transitions. [2025-04-13 17:53:55,778 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:53:55,778 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:53:55,778 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 17:53:55,786 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 17:53:55,978 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:55,979 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 17:53:55,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:53:55,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1399983448, now seen corresponding path program 113 times [2025-04-13 17:53:55,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:53:55,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728827119] [2025-04-13 17:53:55,979 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:53:55,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:53:55,991 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:53:56,005 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:56,005 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:53:56,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:53:56,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:53:56,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728827119] [2025-04-13 17:53:56,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728827119] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:53:56,612 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389364838] [2025-04-13 17:53:56,612 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:53:56,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:53:56,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:53:56,613 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 17:53:56,615 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 17:53:57,003 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:53:57,057 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:53:57,057 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:53:57,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:53:57,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-04-13 17:53:57,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:53:57,478 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:53:57,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:53:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-13 17:53:57,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:53:57,956 INFO L325 Elim1Store]: treesize reduction 11, result has 93.9 percent of original size [2025-04-13 17:53:57,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 149 treesize of output 211 [2025-04-13 17:53:58,856 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 17:53:58,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389364838] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:53:58,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:53:58,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 11] total 44 [2025-04-13 17:53:58,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678184976] [2025-04-13 17:53:58,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:53:58,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-13 17:53:58,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:53:58,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-13 17:53:58,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1825, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 17:53:58,857 INFO L87 Difference]: Start difference. First operand 599 states and 1821 transitions. Second operand has 45 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:05,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:05,242 INFO L93 Difference]: Finished difference Result 746 states and 2158 transitions. [2025-04-13 17:54:05,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 17:54:05,242 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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 17:54:05,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:05,244 INFO L225 Difference]: With dead ends: 746 [2025-04-13 17:54:05,244 INFO L226 Difference]: Without dead ends: 716 [2025-04-13 17:54:05,244 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=825, Invalid=8487, Unknown=0, NotChecked=0, Total=9312 [2025-04-13 17:54:05,245 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 286 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:05,245 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 0 Invalid, 2163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:54:05,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-04-13 17:54:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 609. [2025-04-13 17:54:06,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 608 states have (on average 3.049342105263158) internal successors, (1854), 608 states have internal predecessors, (1854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1854 transitions. [2025-04-13 17:54:06,840 INFO L79 Accepts]: Start accepts. Automaton has 609 states and 1854 transitions. Word has length 30 [2025-04-13 17:54:06,840 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:06,840 INFO L485 AbstractCegarLoop]: Abstraction has 609 states and 1854 transitions. [2025-04-13 17:54:06,840 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 45 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:06,840 INFO L278 IsEmpty]: Start isEmpty. Operand 609 states and 1854 transitions. [2025-04-13 17:54:06,840 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:54:06,840 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:06,840 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 17:54:06,850 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 17:54:07,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:07,041 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 17:54:07,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash -2042650424, now seen corresponding path program 114 times [2025-04-13 17:54:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:07,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651179600] [2025-04-13 17:54:07,041 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:54:07,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:07,054 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:54:07,070 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:54:07,070 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:54:07,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:07,557 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 17:54:07,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:07,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651179600] [2025-04-13 17:54:07,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651179600] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:07,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810400256] [2025-04-13 17:54:07,558 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:54:07,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:07,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:07,560 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 17:54:07,561 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 17:54:07,970 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:54:07,999 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:54:07,999 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:54:07,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:08,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:54:08,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:54:08,357 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:54:08,357 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:54:08,380 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 17:54:08,380 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:54:08,748 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:54:08,748 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 205 treesize of output 247 [2025-04-13 17:54:10,459 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 17:54:10,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810400256] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:54:10,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:54:10,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 17:54:10,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923519664] [2025-04-13 17:54:10,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:54:10,460 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:54:10,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:54:10,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:54:10,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1214, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:54:10,461 INFO L87 Difference]: Start difference. First operand 609 states and 1854 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:16,309 INFO L93 Difference]: Finished difference Result 784 states and 2222 transitions. [2025-04-13 17:54:16,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 17:54:16,310 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:54:16,310 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:16,312 INFO L225 Difference]: With dead ends: 784 [2025-04-13 17:54:16,312 INFO L226 Difference]: Without dead ends: 753 [2025-04-13 17:54:16,312 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=704, Invalid=6606, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 17:54:16,312 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:16,313 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 1823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:54:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2025-04-13 17:54:18,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 624. [2025-04-13 17:54:18,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 623 states have (on average 3.059390048154093) internal successors, (1906), 623 states have internal predecessors, (1906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:18,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 1906 transitions. [2025-04-13 17:54:18,005 INFO L79 Accepts]: Start accepts. Automaton has 624 states and 1906 transitions. Word has length 30 [2025-04-13 17:54:18,005 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:18,005 INFO L485 AbstractCegarLoop]: Abstraction has 624 states and 1906 transitions. [2025-04-13 17:54:18,005 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:18,005 INFO L278 IsEmpty]: Start isEmpty. Operand 624 states and 1906 transitions. [2025-04-13 17:54:18,006 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:54:18,006 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:18,006 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:54:18,014 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 17:54:18,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:18,206 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 17:54:18,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash -491135144, now seen corresponding path program 115 times [2025-04-13 17:54:18,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:18,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527955324] [2025-04-13 17:54:18,207 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:54:18,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:18,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:54:18,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:54:18,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:54:18,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:18,793 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 17:54:18,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:18,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527955324] [2025-04-13 17:54:18,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527955324] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:18,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862397728] [2025-04-13 17:54:18,793 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:54:18,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:18,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:18,795 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 17:54:18,796 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 17:54:19,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:54:19,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:54:19,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:54:19,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:19,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:54:19,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:54:19,460 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:54:19,460 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:54:19,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 17:54:19,483 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:54:19,665 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:54:19,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 214 treesize of output 212 [2025-04-13 17:54:20,527 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 17:54:20,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862397728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:54:20,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:54:20,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 17:54:20,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425299799] [2025-04-13 17:54:20,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:54:20,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:54:20,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:54:20,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:54:20,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:54:20,528 INFO L87 Difference]: Start difference. First operand 624 states and 1906 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:25,763 INFO L93 Difference]: Finished difference Result 730 states and 2131 transitions. [2025-04-13 17:54:25,763 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 17:54:25,764 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:54:25,764 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:25,765 INFO L225 Difference]: With dead ends: 730 [2025-04-13 17:54:25,765 INFO L226 Difference]: Without dead ends: 696 [2025-04-13 17:54:25,766 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2028 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=797, Invalid=7575, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 17:54:25,766 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:25,766 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:54:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-04-13 17:54:27,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 628. [2025-04-13 17:54:27,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 3.055821371610845) internal successors, (1916), 627 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:27,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 1916 transitions. [2025-04-13 17:54:27,432 INFO L79 Accepts]: Start accepts. Automaton has 628 states and 1916 transitions. Word has length 30 [2025-04-13 17:54:27,432 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:27,432 INFO L485 AbstractCegarLoop]: Abstraction has 628 states and 1916 transitions. [2025-04-13 17:54:27,432 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:27,432 INFO L278 IsEmpty]: Start isEmpty. Operand 628 states and 1916 transitions. [2025-04-13 17:54:27,433 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:54:27,433 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:27,433 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 17:54:27,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2025-04-13 17:54:27,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2025-04-13 17:54:27,633 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 17:54:27,633 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash -438549224, now seen corresponding path program 116 times [2025-04-13 17:54:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:27,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756057021] [2025-04-13 17:54:27,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:54:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:27,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:54:27,659 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:54:27,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:54:27,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:28,088 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 17:54:28,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:28,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756057021] [2025-04-13 17:54:28,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756057021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:28,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875364189] [2025-04-13 17:54:28,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:54:28,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:28,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:28,090 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 17:54:28,090 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 17:54:28,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:54:28,514 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:54:28,514 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:54:28,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:28,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-04-13 17:54:28,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:54:28,875 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:54:28,875 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:54:28,901 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 17:54:28,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:54:29,325 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:54:29,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 201 treesize of output 247 [2025-04-13 17:54:31,489 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 17:54:31,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875364189] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:54:31,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:54:31,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 17:54:31,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459414294] [2025-04-13 17:54:31,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:54:31,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:54:31,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:54:31,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:54:31,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1394, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:54:31,490 INFO L87 Difference]: Start difference. First operand 628 states and 1916 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:38,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:38,350 INFO L93 Difference]: Finished difference Result 864 states and 2447 transitions. [2025-04-13 17:54:38,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 17:54:38,350 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:54:38,350 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:38,353 INFO L225 Difference]: With dead ends: 864 [2025-04-13 17:54:38,353 INFO L226 Difference]: Without dead ends: 833 [2025-04-13 17:54:38,353 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3282 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1058, Invalid=8842, Unknown=0, NotChecked=0, Total=9900 [2025-04-13 17:54:38,353 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 310 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:38,353 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 0 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:54:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2025-04-13 17:54:40,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 626. [2025-04-13 17:54:40,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 3.0544) internal successors, (1909), 625 states have internal predecessors, (1909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1909 transitions. [2025-04-13 17:54:40,044 INFO L79 Accepts]: Start accepts. Automaton has 626 states and 1909 transitions. Word has length 30 [2025-04-13 17:54:40,044 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:40,044 INFO L485 AbstractCegarLoop]: Abstraction has 626 states and 1909 transitions. [2025-04-13 17:54:40,044 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:40,044 INFO L278 IsEmpty]: Start isEmpty. Operand 626 states and 1909 transitions. [2025-04-13 17:54:40,045 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:54:40,045 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:40,045 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 17:54:40,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2025-04-13 17:54:40,245 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134 [2025-04-13 17:54:40,245 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 17:54:40,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:40,245 INFO L85 PathProgramCache]: Analyzing trace with hash 222966382, now seen corresponding path program 117 times [2025-04-13 17:54:40,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:40,245 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726156584] [2025-04-13 17:54:40,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:54:40,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:40,258 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:54:40,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 17:54:40,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:54:40,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:40,700 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 17:54:40,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:40,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726156584] [2025-04-13 17:54:40,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726156584] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:40,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287052319] [2025-04-13 17:54:40,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:54:40,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:40,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:40,702 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 17:54:40,702 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 17:54:41,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:54:41,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 28 of 30 statements. [2025-04-13 17:54:41,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 17:54:41,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:41,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:54:41,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:54:41,418 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:54:41,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:54: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 17:54:41,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:54:41,987 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:54:41,987 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 195 treesize of output 233 [2025-04-13 17:54:44,374 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 17:54:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287052319] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:54:44,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:54:44,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 17:54:44,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923701248] [2025-04-13 17:54:44,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:54:44,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:54:44,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:54:44,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:54:44,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:54:44,375 INFO L87 Difference]: Start difference. First operand 626 states and 1909 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 17:54:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:49,902 INFO L93 Difference]: Finished difference Result 757 states and 2209 transitions. [2025-04-13 17:54:49,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 17:54:49,902 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 17:54:49,902 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:49,904 INFO L225 Difference]: With dead ends: 757 [2025-04-13 17:54:49,904 INFO L226 Difference]: Without dead ends: 732 [2025-04-13 17:54:49,905 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=509, Invalid=3913, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 17:54:49,905 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:49,905 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:54:49,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2025-04-13 17:54:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 640. [2025-04-13 17:54:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 3.054773082942097) internal successors, (1952), 639 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:51,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1952 transitions. [2025-04-13 17:54:51,682 INFO L79 Accepts]: Start accepts. Automaton has 640 states and 1952 transitions. Word has length 30 [2025-04-13 17:54:51,682 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:51,682 INFO L485 AbstractCegarLoop]: Abstraction has 640 states and 1952 transitions. [2025-04-13 17:54:51,682 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 17:54:51,682 INFO L278 IsEmpty]: Start isEmpty. Operand 640 states and 1952 transitions. [2025-04-13 17:54:51,683 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:54:51,683 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:51,683 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 17:54:51,691 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 17:54:51,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2025-04-13 17:54:51,883 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 17:54:51,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:51,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1774481662, now seen corresponding path program 118 times [2025-04-13 17:54:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:51,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965417385] [2025-04-13 17:54:51,884 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:54:51,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:51,897 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:54:51,901 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:54:51,901 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:54:51,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:52,129 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 17:54:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:52,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965417385] [2025-04-13 17:54:52,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965417385] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:52,130 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608181677] [2025-04-13 17:54:52,130 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:54:52,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:52,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:52,132 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 17:54:52,134 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 17:54:52,535 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:54:52,544 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:54:52,544 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:54:52,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:52,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:54:52,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:54:52,707 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:54:52,707 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:54:52,729 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 17:54:52,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:54:52,883 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:54:52,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 199 treesize of output 197 [2025-04-13 17:54:53,391 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 17:54:53,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608181677] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:54:53,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:54:53,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 26 [2025-04-13 17:54:53,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187402432] [2025-04-13 17:54:53,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:54:53,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-13 17:54:53,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:54:53,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-13 17:54:53,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2025-04-13 17:54:53,391 INFO L87 Difference]: Start difference. First operand 640 states and 1952 transitions. Second operand has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:57,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:54:57,206 INFO L93 Difference]: Finished difference Result 731 states and 2166 transitions. [2025-04-13 17:54:57,206 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 17:54:57,206 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:54:57,206 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:54:57,208 INFO L225 Difference]: With dead ends: 731 [2025-04-13 17:54:57,208 INFO L226 Difference]: Without dead ends: 709 [2025-04-13 17:54:57,208 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=254, Invalid=2098, Unknown=0, NotChecked=0, Total=2352 [2025-04-13 17:54:57,209 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 96 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:54:57,209 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 0 Invalid, 1057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:54:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-04-13 17:54:58,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 642. [2025-04-13 17:54:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 3.0530421216848675) internal successors, (1957), 641 states have internal predecessors, (1957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1957 transitions. [2025-04-13 17:54:58,979 INFO L79 Accepts]: Start accepts. Automaton has 642 states and 1957 transitions. Word has length 30 [2025-04-13 17:54:58,979 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:54:58,979 INFO L485 AbstractCegarLoop]: Abstraction has 642 states and 1957 transitions. [2025-04-13 17:54:58,979 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.6923076923076923) internal successors, (44), 27 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:54:58,979 INFO L278 IsEmpty]: Start isEmpty. Operand 642 states and 1957 transitions. [2025-04-13 17:54:58,979 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:54:58,980 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:54:58,980 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 17:54:58,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2025-04-13 17:54:59,180 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2025-04-13 17:54:59,180 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 17:54:59,180 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:54:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1477569896, now seen corresponding path program 119 times [2025-04-13 17:54:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:54:59,180 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450187906] [2025-04-13 17:54:59,181 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:54:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:54:59,192 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:54:59,211 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:54:59,211 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:54:59,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:54:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-04-13 17:54:59,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:54:59,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450187906] [2025-04-13 17:54:59,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450187906] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:54:59,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988672649] [2025-04-13 17:54:59,705 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:54:59,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:54:59,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:54:59,707 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 17:54:59,708 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 17:55:00,114 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:55:00,175 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:00,175 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:55:00,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:00,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-04-13 17:55:00,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:00,433 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:55:00,434 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:55:00,459 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 17:55:00,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:00,617 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:00,617 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:55:01,152 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 17:55:01,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988672649] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:01,153 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:01,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 11] total 35 [2025-04-13 17:55:01,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241183539] [2025-04-13 17:55:01,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:01,153 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:55:01,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:01,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:55:01,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1144, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:55:01,153 INFO L87 Difference]: Start difference. First operand 642 states and 1957 transitions. Second operand has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:05,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:05,432 INFO L93 Difference]: Finished difference Result 731 states and 2157 transitions. [2025-04-13 17:55:05,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 17:55:05,432 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:55:05,432 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:05,434 INFO L225 Difference]: With dead ends: 731 [2025-04-13 17:55:05,434 INFO L226 Difference]: Without dead ends: 705 [2025-04-13 17:55:05,435 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=469, Invalid=4787, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 17:55:05,435 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:05,435 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 0 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:55:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2025-04-13 17:55:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 646. [2025-04-13 17:55:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 3.055813953488372) internal successors, (1971), 645 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 1971 transitions. [2025-04-13 17:55:07,219 INFO L79 Accepts]: Start accepts. Automaton has 646 states and 1971 transitions. Word has length 30 [2025-04-13 17:55:07,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:07,219 INFO L485 AbstractCegarLoop]: Abstraction has 646 states and 1971 transitions. [2025-04-13 17:55:07,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.6857142857142857) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:07,219 INFO L278 IsEmpty]: Start isEmpty. Operand 646 states and 1971 transitions. [2025-04-13 17:55:07,220 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:55:07,220 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:07,220 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 17:55:07,230 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 17:55:07,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable137 [2025-04-13 17:55:07,421 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 17:55:07,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1424983976, now seen corresponding path program 120 times [2025-04-13 17:55:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:07,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169039347] [2025-04-13 17:55:07,421 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:55:07,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:07,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:55:07,452 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:07,452 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:55:07,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:07,869 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 17:55:07,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:07,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169039347] [2025-04-13 17:55:07,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169039347] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:07,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079569264] [2025-04-13 17:55:07,869 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:55:07,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:07,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:07,871 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 17:55:07,872 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 17:55:08,294 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:55:08,326 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:08,326 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:55:08,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:08,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:55:08,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:08,682 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:55:08,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:55:08,707 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 17:55:08,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:08,830 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:08,830 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 226 treesize of output 222 [2025-04-13 17:55:10,181 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 17:55:10,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079569264] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:10,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:10,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2025-04-13 17:55:10,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207557777] [2025-04-13 17:55:10,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:10,181 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 17:55:10,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:10,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 17:55:10,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1151, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 17:55:10,182 INFO L87 Difference]: Start difference. First operand 646 states and 1971 transitions. Second operand has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:16,732 INFO L93 Difference]: Finished difference Result 918 states and 2802 transitions. [2025-04-13 17:55:16,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 17:55:16,732 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:55:16,732 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:16,734 INFO L225 Difference]: With dead ends: 918 [2025-04-13 17:55:16,735 INFO L226 Difference]: Without dead ends: 869 [2025-04-13 17:55:16,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2102 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=880, Invalid=5762, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 17:55:16,735 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:16,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 17:55:16,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-04-13 17:55:18,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 768. [2025-04-13 17:55:18,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 767 states have (on average 3.1577574967405475) internal successors, (2422), 767 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:18,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 2422 transitions. [2025-04-13 17:55:18,980 INFO L79 Accepts]: Start accepts. Automaton has 768 states and 2422 transitions. Word has length 30 [2025-04-13 17:55:18,980 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:18,980 INFO L485 AbstractCegarLoop]: Abstraction has 768 states and 2422 transitions. [2025-04-13 17:55:18,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.75) internal successors, (63), 37 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:18,980 INFO L278 IsEmpty]: Start isEmpty. Operand 768 states and 2422 transitions. [2025-04-13 17:55:18,981 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:55:18,981 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:18,981 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 17:55:18,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Forceful destruction successful, exit code 0 [2025-04-13 17:55:19,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable138 [2025-04-13 17:55:19,181 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 17:55:19,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:19,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1654162734, now seen corresponding path program 121 times [2025-04-13 17:55:19,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:19,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785840016] [2025-04-13 17:55:19,182 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:55:19,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:19,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:55:19,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:19,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:55:19,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:19,802 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 17:55:19,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:19,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785840016] [2025-04-13 17:55:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785840016] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:19,803 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587195868] [2025-04-13 17:55:19,803 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:55:19,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:19,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:19,805 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 17:55:19,805 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 17:55:20,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:55:20,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:20,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:55:20,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:20,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:55:20,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:20,494 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:55:20,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 91 treesize of output 52 [2025-04-13 17:55:20,519 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 17:55:20,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:20,687 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:20,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 210 treesize of output 206 [2025-04-13 17:55:21,276 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 17:55:21,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587195868] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:21,277 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:21,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 39 [2025-04-13 17:55:21,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453651574] [2025-04-13 17:55:21,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:21,277 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:55:21,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:21,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:55:21,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:55:21,278 INFO L87 Difference]: Start difference. First operand 768 states and 2422 transitions. Second operand has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:26,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:26,637 INFO L93 Difference]: Finished difference Result 888 states and 2695 transitions. [2025-04-13 17:55:26,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 17:55:26,637 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:55:26,637 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:26,640 INFO L225 Difference]: With dead ends: 888 [2025-04-13 17:55:26,640 INFO L226 Difference]: Without dead ends: 869 [2025-04-13 17:55:26,640 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=631, Invalid=6011, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 17:55:26,640 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 187 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1682 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:26,640 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 0 Invalid, 1718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1682 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:55:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-04-13 17:55:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 780. [2025-04-13 17:55:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 3.165596919127086) internal successors, (2466), 779 states have internal predecessors, (2466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2466 transitions. [2025-04-13 17:55:28,988 INFO L79 Accepts]: Start accepts. Automaton has 780 states and 2466 transitions. Word has length 30 [2025-04-13 17:55:28,988 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:28,988 INFO L485 AbstractCegarLoop]: Abstraction has 780 states and 2466 transitions. [2025-04-13 17:55:28,988 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.7435897435897436) internal successors, (68), 40 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:28,988 INFO L278 IsEmpty]: Start isEmpty. Operand 780 states and 2466 transitions. [2025-04-13 17:55:28,989 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:55:28,989 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:28,989 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 17:55:28,998 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 17:55:29,189 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:29,189 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 17:55:29,189 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:29,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1656699774, now seen corresponding path program 122 times [2025-04-13 17:55:29,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:29,190 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435821317] [2025-04-13 17:55:29,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:55:29,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:29,201 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:55:29,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:29,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:55:29,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:29,658 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 17:55:29,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:29,658 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435821317] [2025-04-13 17:55:29,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435821317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:29,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850453476] [2025-04-13 17:55:29,659 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:55:29,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:29,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:29,660 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 17:55:29,661 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 17:55:30,090 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:55:30,113 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:30,113 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:55:30,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:30,114 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-04-13 17:55:30,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:30,444 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:55:30,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:55:30,470 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 17:55:30,470 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:30,586 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:30,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 211 treesize of output 207 [2025-04-13 17:55:31,315 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 17:55:31,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850453476] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:31,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:31,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 39 [2025-04-13 17:55:31,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633912158] [2025-04-13 17:55:31,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:31,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 17:55:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:31,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 17:55:31,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 17:55:31,316 INFO L87 Difference]: Start difference. First operand 780 states and 2466 transitions. Second operand has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:36,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:36,948 INFO L93 Difference]: Finished difference Result 944 states and 2830 transitions. [2025-04-13 17:55:36,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 17:55:36,948 INFO L79 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:55:36,948 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:36,950 INFO L225 Difference]: With dead ends: 944 [2025-04-13 17:55:36,950 INFO L226 Difference]: Without dead ends: 904 [2025-04-13 17:55:36,951 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2547 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=714, Invalid=6596, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 17:55:36,951 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:36,951 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:55:36,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2025-04-13 17:55:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 785. [2025-04-13 17:55:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 784 states have (on average 3.1683673469387754) internal successors, (2484), 784 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 2484 transitions. [2025-04-13 17:55:39,347 INFO L79 Accepts]: Start accepts. Automaton has 785 states and 2484 transitions. Word has length 30 [2025-04-13 17:55:39,347 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:39,347 INFO L485 AbstractCegarLoop]: Abstraction has 785 states and 2484 transitions. [2025-04-13 17:55:39,347 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 40 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:39,347 INFO L278 IsEmpty]: Start isEmpty. Operand 785 states and 2484 transitions. [2025-04-13 17:55:39,348 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:55:39,348 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:39,348 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 17:55:39,357 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 17:55:39,548 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:39,548 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 17:55:39,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:39,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1767522294, now seen corresponding path program 123 times [2025-04-13 17:55:39,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:39,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404303352] [2025-04-13 17:55:39,549 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:55:39,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:39,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:55:39,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:39,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:55:39,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:40,452 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-13 17:55:40,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:40,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404303352] [2025-04-13 17:55:40,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404303352] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:40,452 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160759686] [2025-04-13 17:55:40,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:55:40,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:40,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:40,454 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 17:55:40,455 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 17:55:40,879 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:55:40,910 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:55:40,910 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:55:40,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:40,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 17:55:40,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:41,253 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:55:41,254 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:55:41,281 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 17:55:41,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:41,421 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:41,421 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:55:42,148 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 17:55:42,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160759686] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:42,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:42,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 11] total 40 [2025-04-13 17:55:42,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545697255] [2025-04-13 17:55:42,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:42,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-13 17:55:42,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:42,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-13 17:55:42,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1472, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 17:55:42,149 INFO L87 Difference]: Start difference. First operand 785 states and 2484 transitions. Second operand has 41 states, 40 states have (on average 1.675) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:48,527 INFO L93 Difference]: Finished difference Result 944 states and 2825 transitions. [2025-04-13 17:55:48,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 17:55:48,527 INFO L79 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 1.675) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:55:48,527 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:48,530 INFO L225 Difference]: With dead ends: 944 [2025-04-13 17:55:48,530 INFO L226 Difference]: Without dead ends: 906 [2025-04-13 17:55:48,530 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2700 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=920, Invalid=8010, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 17:55:48,531 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 255 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:48,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 0 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:55:48,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2025-04-13 17:55:50,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 789. [2025-04-13 17:55:50,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 3.16751269035533) internal successors, (2496), 788 states have internal predecessors, (2496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:50,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 2496 transitions. [2025-04-13 17:55:50,890 INFO L79 Accepts]: Start accepts. Automaton has 789 states and 2496 transitions. Word has length 30 [2025-04-13 17:55:50,890 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:50,890 INFO L485 AbstractCegarLoop]: Abstraction has 789 states and 2496 transitions. [2025-04-13 17:55:50,890 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 1.675) internal successors, (67), 41 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:50,890 INFO L278 IsEmpty]: Start isEmpty. Operand 789 states and 2496 transitions. [2025-04-13 17:55:50,891 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:55:50,891 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:50,891 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 17:55:50,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Ended with exit code 0 [2025-04-13 17:55:51,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:51,091 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 17:55:51,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:55:51,091 INFO L85 PathProgramCache]: Analyzing trace with hash 908053118, now seen corresponding path program 124 times [2025-04-13 17:55:51,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:55:51,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967892796] [2025-04-13 17:55:51,092 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:55:51,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:55:51,105 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:55:51,109 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:55:51,109 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:55:51,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:51,345 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 17:55:51,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:55:51,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967892796] [2025-04-13 17:55:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967892796] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:55:51,345 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594343221] [2025-04-13 17:55:51,345 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:55:51,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:55:51,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:55:51,347 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 17:55:51,347 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 17:55:51,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:55:51,773 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:55:51,773 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:55:51,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:55:51,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:55:51,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:55:51,960 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:55:51,960 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:55:51,985 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 17:55:51,985 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:55:52,152 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:55:52,153 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 215 treesize of output 213 [2025-04-13 17:55:52,705 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 17:55:52,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594343221] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:55:52,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:55:52,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-13 17:55:52,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913525501] [2025-04-13 17:55:52,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:55:52,706 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:55:52,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:55:52,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:55:52,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:55:52,706 INFO L87 Difference]: Start difference. First operand 789 states and 2496 transitions. Second operand has 28 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 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 17:55:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:55:57,478 INFO L93 Difference]: Finished difference Result 873 states and 2704 transitions. [2025-04-13 17:55:57,478 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 17:55:57,478 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:55:57,478 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:55:57,480 INFO L225 Difference]: With dead ends: 873 [2025-04-13 17:55:57,480 INFO L226 Difference]: Without dead ends: 852 [2025-04-13 17:55:57,481 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=256, Invalid=2000, Unknown=0, NotChecked=0, Total=2256 [2025-04-13 17:55:57,481 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 17:55:57,481 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 0 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 17:55:57,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2025-04-13 17:55:59,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 791. [2025-04-13 17:55:59,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 3.160759493670886) internal successors, (2497), 790 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:55:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 2497 transitions. [2025-04-13 17:55:59,899 INFO L79 Accepts]: Start accepts. Automaton has 791 states and 2497 transitions. Word has length 30 [2025-04-13 17:55:59,899 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:55:59,899 INFO L485 AbstractCegarLoop]: Abstraction has 791 states and 2497 transitions. [2025-04-13 17:55:59,899 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 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 17:55:59,899 INFO L278 IsEmpty]: Start isEmpty. Operand 791 states and 2497 transitions. [2025-04-13 17:55:59,900 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:55:59,900 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:55:59,900 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 17:55:59,908 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 17:56:00,100 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:00,100 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 17:56:00,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash 34312438, now seen corresponding path program 125 times [2025-04-13 17:56:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:00,101 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975335317] [2025-04-13 17:56:00,101 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:56:00,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:00,113 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:56:00,131 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:00,131 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:56:00,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:00,744 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 17:56:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:00,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975335317] [2025-04-13 17:56:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975335317] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:00,744 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892432836] [2025-04-13 17:56:00,744 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 17:56:00,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:00,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:00,746 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 17:56:00,746 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 17:56:01,169 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:56:01,326 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:01,326 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 17:56:01,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:01,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 17:56:01,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:01,671 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:56:01,672 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 52 [2025-04-13 17:56:01,704 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 17:56:01,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:01,940 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:56:01,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 211 treesize of output 209 [2025-04-13 17:56:02,360 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 17:56:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892432836] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:02,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:02,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 11] total 41 [2025-04-13 17:56:02,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728778671] [2025-04-13 17:56:02,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:02,361 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-04-13 17:56:02,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:02,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-04-13 17:56:02,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1578, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 17:56:02,361 INFO L87 Difference]: Start difference. First operand 791 states and 2497 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 17:56:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:56:08,049 INFO L93 Difference]: Finished difference Result 869 states and 2692 transitions. [2025-04-13 17:56:08,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 17:56:08,050 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 17:56:08,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:56:08,052 INFO L225 Difference]: With dead ends: 869 [2025-04-13 17:56:08,052 INFO L226 Difference]: Without dead ends: 846 [2025-04-13 17:56:08,052 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=480, Invalid=5372, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 17:56:08,053 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 143 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:56:08,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 0 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:56:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2025-04-13 17:56:10,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 793. [2025-04-13 17:56:10,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 792 states have (on average 3.154040404040404) internal successors, (2498), 792 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 2498 transitions. [2025-04-13 17:56:10,502 INFO L79 Accepts]: Start accepts. Automaton has 793 states and 2498 transitions. Word has length 30 [2025-04-13 17:56:10,503 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:56:10,503 INFO L485 AbstractCegarLoop]: Abstraction has 793 states and 2498 transitions. [2025-04-13 17:56:10,503 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 17:56:10,503 INFO L278 IsEmpty]: Start isEmpty. Operand 793 states and 2498 transitions. [2025-04-13 17:56:10,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:56:10,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:56:10,504 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 17:56:10,513 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 17:56:10,704 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143,135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:10,704 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 17:56:10,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:10,704 INFO L85 PathProgramCache]: Analyzing trace with hash -2106947404, now seen corresponding path program 126 times [2025-04-13 17:56:10,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:10,705 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833557003] [2025-04-13 17:56:10,705 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:56:10,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:10,717 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:56:10,734 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:10,734 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:56:10,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:11,231 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 17:56:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:11,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833557003] [2025-04-13 17:56:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833557003] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:11,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960396680] [2025-04-13 17:56:11,232 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 17:56:11,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:11,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:11,234 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 17:56:11,235 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 17:56:11,684 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:56:11,715 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:11,715 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-04-13 17:56:11,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:11,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-04-13 17:56:11,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:12,018 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:56:12,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:56:12,043 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 17:56:12,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:12,346 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:56:12,346 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 219 treesize of output 281 [2025-04-13 17:56:14,201 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 17:56:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960396680] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:14,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:14,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 35 [2025-04-13 17:56:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963338422] [2025-04-13 17:56:14,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:14,202 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 17:56:14,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:14,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 17:56:14,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1113, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:56:14,202 INFO L87 Difference]: Start difference. First operand 793 states and 2498 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 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 17:56:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:56:20,223 INFO L93 Difference]: Finished difference Result 903 states and 2727 transitions. [2025-04-13 17:56:20,223 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 17:56:20,224 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:56:20,224 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:56:20,226 INFO L225 Difference]: With dead ends: 903 [2025-04-13 17:56:20,226 INFO L226 Difference]: Without dead ends: 873 [2025-04-13 17:56:20,227 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1503 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=577, Invalid=4535, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 17:56:20,227 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 194 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 17:56:20,227 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 0 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 17:56:20,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-04-13 17:56:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 799. [2025-04-13 17:56:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 798 states have (on average 3.154135338345865) internal successors, (2517), 798 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 2517 transitions. [2025-04-13 17:56:22,741 INFO L79 Accepts]: Start accepts. Automaton has 799 states and 2517 transitions. Word has length 30 [2025-04-13 17:56:22,741 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:56:22,741 INFO L485 AbstractCegarLoop]: Abstraction has 799 states and 2517 transitions. [2025-04-13 17:56:22,742 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 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 17:56:22,742 INFO L278 IsEmpty]: Start isEmpty. Operand 799 states and 2517 transitions. [2025-04-13 17:56:22,742 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:56:22,743 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:56:22,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 17:56:22,751 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 17:56:22,943 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:22,943 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 17:56:22,943 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:22,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1254613980, now seen corresponding path program 127 times [2025-04-13 17:56:22,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:22,943 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777318529] [2025-04-13 17:56:22,944 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:56:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:22,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:56:22,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:22,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:56:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:23,613 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 17:56:23,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:23,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777318529] [2025-04-13 17:56:23,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777318529] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:23,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239420300] [2025-04-13 17:56:23,614 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 17:56:23,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:23,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:23,615 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 17:56:23,616 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 17:56:24,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 17:56:24,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:24,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 17:56:24,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:24,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 17:56:24,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:24,290 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:56:24,291 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:56:24,316 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 17:56:24,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:24,514 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:56:24,515 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 197 [2025-04-13 17:56:25,069 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 17:56:25,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239420300] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:25,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:25,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 11] total 37 [2025-04-13 17:56:25,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335610200] [2025-04-13 17:56:25,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:25,069 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 17:56:25,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:25,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 17:56:25,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1281, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 17:56:25,070 INFO L87 Difference]: Start difference. First operand 799 states and 2517 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 17:56:31,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:56:31,199 INFO L93 Difference]: Finished difference Result 915 states and 2789 transitions. [2025-04-13 17:56:31,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 17:56:31,199 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 17:56:31,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:56:31,202 INFO L225 Difference]: With dead ends: 915 [2025-04-13 17:56:31,202 INFO L226 Difference]: Without dead ends: 890 [2025-04-13 17:56:31,202 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=614, Invalid=5238, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 17:56:31,202 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 17:56:31,202 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 1555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 17:56:31,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-04-13 17:56:33,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 803. [2025-04-13 17:56:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 802 states have (on average 3.153366583541147) internal successors, (2529), 802 states have internal predecessors, (2529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:33,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 2529 transitions. [2025-04-13 17:56:33,653 INFO L79 Accepts]: Start accepts. Automaton has 803 states and 2529 transitions. Word has length 30 [2025-04-13 17:56:33,653 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:56:33,653 INFO L485 AbstractCegarLoop]: Abstraction has 803 states and 2529 transitions. [2025-04-13 17:56:33,653 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 17:56:33,653 INFO L278 IsEmpty]: Start isEmpty. Operand 803 states and 2529 transitions. [2025-04-13 17:56:33,654 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:56:33,654 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:56:33,654 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 17:56:33,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2025-04-13 17:56:33,854 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2025-04-13 17:56:33,855 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 17:56:33,855 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:33,855 INFO L85 PathProgramCache]: Analyzing trace with hash 296901300, now seen corresponding path program 128 times [2025-04-13 17:56:33,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:33,855 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782473788] [2025-04-13 17:56:33,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:56:33,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:33,867 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:56:33,878 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:33,878 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:56:33,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:34,320 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 17:56:34,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:34,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782473788] [2025-04-13 17:56:34,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782473788] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:34,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942787677] [2025-04-13 17:56:34,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 17:56:34,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:34,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:34,322 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 17:56:34,323 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 17:56:34,761 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:56:34,785 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:34,785 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 17:56:34,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:34,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-04-13 17:56:34,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:35,016 INFO L325 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2025-04-13 17:56:35,016 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 50 [2025-04-13 17:56:35,036 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 17:56:35,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:35,417 INFO L325 Elim1Store]: treesize reduction 11, result has 93.7 percent of original size [2025-04-13 17:56:35,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 233 [2025-04-13 17:56:36,809 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 17:56:36,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942787677] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:36,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:36,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 11] total 31 [2025-04-13 17:56:36,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884412423] [2025-04-13 17:56:36,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:36,810 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 17:56:36,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:36,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 17:56:36,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2025-04-13 17:56:36,810 INFO L87 Difference]: Start difference. First operand 803 states and 2529 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 17:56:44,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:56:44,996 INFO L93 Difference]: Finished difference Result 1040 states and 3051 transitions. [2025-04-13 17:56:44,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 17:56:44,997 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 17:56:44,997 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:56:44,999 INFO L225 Difference]: With dead ends: 1040 [2025-04-13 17:56:44,999 INFO L226 Difference]: Without dead ends: 1001 [2025-04-13 17:56:45,000 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2512 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=817, Invalid=6839, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 17:56:45,000 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 260 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:56:45,000 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 0 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:56:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-04-13 17:56:47,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 819. [2025-04-13 17:56:47,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 818 states have (on average 3.167481662591687) internal successors, (2591), 818 states have internal predecessors, (2591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 2591 transitions. [2025-04-13 17:56:47,608 INFO L79 Accepts]: Start accepts. Automaton has 819 states and 2591 transitions. Word has length 30 [2025-04-13 17:56:47,608 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:56:47,608 INFO L485 AbstractCegarLoop]: Abstraction has 819 states and 2591 transitions. [2025-04-13 17:56:47,608 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 17:56:47,608 INFO L278 IsEmpty]: Start isEmpty. Operand 819 states and 2591 transitions. [2025-04-13 17:56:47,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:56:47,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:56:47,609 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 17:56:47,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Ended with exit code 0 [2025-04-13 17:56:47,810 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable146 [2025-04-13 17:56:47,810 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 17:56:47,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:56:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash 346950180, now seen corresponding path program 129 times [2025-04-13 17:56:47,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:56:47,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435311037] [2025-04-13 17:56:47,810 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:56:47,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:56:47,824 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:56:47,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:47,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:56:47,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:48,330 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 17:56:48,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:56:48,330 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435311037] [2025-04-13 17:56:48,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435311037] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:56:48,331 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204444486] [2025-04-13 17:56:48,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:56:48,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:56:48,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:56:48,332 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 17:56:48,333 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 17:56:48,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 4 equivalence classes. [2025-04-13 17:56:48,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 17:56:48,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 17:56:48,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:56:48,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-04-13 17:56:48,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:56:49,007 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 23 treesize of output 1 [2025-04-13 17:56:49,017 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 17:56:49,437 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-13 17:56:49,438 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 47 [2025-04-13 17:56:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-13 17:56:49,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:56:50,907 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 17:56:50,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204444486] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:56:50,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:56:50,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 11] total 42 [2025-04-13 17:56:50,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154330762] [2025-04-13 17:56:50,908 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:56:50,908 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-04-13 17:56:50,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:56:50,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-04-13 17:56:50,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1616, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 17:56:50,908 INFO L87 Difference]: Start difference. First operand 819 states and 2591 transitions. Second operand has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:56:55,289 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:56:59,510 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:03,524 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:07,547 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:11,564 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:15,568 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:19,583 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:23,593 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:27,617 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:31,623 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:35,631 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:39,634 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:43,639 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:47,648 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:51,652 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:55,659 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:57:59,666 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:03,669 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:07,683 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:11,694 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:15,701 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:19,712 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:23,717 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:27,729 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-13 17:58:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:58:40,212 INFO L93 Difference]: Finished difference Result 1030 states and 3074 transitions. [2025-04-13 17:58:40,213 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 17:58:40,213 INFO L79 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-04-13 17:58:40,213 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:58:40,215 INFO L225 Difference]: With dead ends: 1030 [2025-04-13 17:58:40,215 INFO L226 Difference]: Without dead ends: 1001 [2025-04-13 17:58:40,216 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3156 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=852, Invalid=8460, Unknown=0, NotChecked=0, Total=9312 [2025-04-13 17:58:40,216 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 89 mSolverCounterUnsat, 24 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 98.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 24 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 98.9s IncrementalHoareTripleChecker+Time [2025-04-13 17:58:40,216 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1954 Invalid, 24 Unknown, 0 Unchecked, 98.9s Time] [2025-04-13 17:58:40,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-04-13 17:58:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 841. [2025-04-13 17:58:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 3.1857142857142855) internal successors, (2676), 840 states have internal predecessors, (2676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2676 transitions. [2025-04-13 17:58:42,801 INFO L79 Accepts]: Start accepts. Automaton has 841 states and 2676 transitions. Word has length 30 [2025-04-13 17:58:42,801 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:58:42,801 INFO L485 AbstractCegarLoop]: Abstraction has 841 states and 2676 transitions. [2025-04-13 17:58:42,801 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.6428571428571428) internal successors, (69), 43 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:58:42,801 INFO L278 IsEmpty]: Start isEmpty. Operand 841 states and 2676 transitions. [2025-04-13 17:58:42,802 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-13 17:58:42,802 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:58:42,802 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 17:58:42,811 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 17:58:43,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2025-04-13 17:58:43,002 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 17:58:43,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:58:43,002 INFO L85 PathProgramCache]: Analyzing trace with hash 349487220, now seen corresponding path program 130 times [2025-04-13 17:58:43,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:58:43,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963017028] [2025-04-13 17:58:43,003 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:58:43,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:58:43,015 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:58:43,019 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:58:43,019 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:58:43,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:43,262 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 17:58:43,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:58:43,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963017028] [2025-04-13 17:58:43,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963017028] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:58:43,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679956303] [2025-04-13 17:58:43,262 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 17:58:43,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:58:43,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:58:43,264 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 17:58:43,264 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 17:58:43,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-04-13 17:58:43,721 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 17 of 30 statements. [2025-04-13 17:58:43,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 17:58:43,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:58:43,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 17:58:43,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:58:43,920 INFO L325 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2025-04-13 17:58:43,921 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 52 [2025-04-13 17:58:43,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 17:58:43,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:58:44,071 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 17:58:44,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 211 treesize of output 207 [2025-04-13 17:58:44,807 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 17:58:44,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679956303] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:58:44,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:58:44,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-04-13 17:58:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334767235] [2025-04-13 17:58:44,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:58:44,808 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 17:58:44,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:58:44,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 17:58:44,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2025-04-13 17:58:44,808 INFO L87 Difference]: Start difference. First operand 841 states and 2676 transitions. Second operand has 28 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 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) Received shutdown request... [2025-04-13 17:58:45,391 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 17:58:45,392 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 17:58:45,392 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 17:58:45,392 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 17:58:45,393 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:58:45,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2025-04-13 17:58:45,413 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 17:58:45,417 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:58:45,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable148 [2025-04-13 17:58:45,593 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (841states) and FLOYD_HOARE automaton (currently 11 states, 28 states before enhancement),while ReachableStatesComputation was computing reachable states (143 states constructed, input type IntersectNwa). [2025-04-13 17:58:45,595 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:58:45,595 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:58:45,597 INFO L422 BasicCegarLoop]: Path program histogram: [130, 8, 6, 4, 1] [2025-04-13 17:58:45,598 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:58:45,598 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:58:45,599 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:58:45 BasicIcfg [2025-04-13 17:58:45,599 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:58:45,600 INFO L158 Benchmark]: Toolchain (without parser) took 848692.50ms. Allocated memory was 167.8MB in the beginning and 893.4MB in the end (delta: 725.6MB). Free memory was 117.5MB in the beginning and 522.0MB in the end (delta: -404.4MB). Peak memory consumption was 323.8MB. Max. memory is 8.0GB. [2025-04-13 17:58:45,600 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:58:45,600 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.01ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 102.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 17:58:45,600 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.23ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 100.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:58:45,600 INFO L158 Benchmark]: Boogie Preprocessor took 54.98ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 98.5MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:58:45,600 INFO L158 Benchmark]: RCFGBuilder took 561.68ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 41.5MB in the end (delta: 57.0MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2025-04-13 17:58:45,600 INFO L158 Benchmark]: TraceAbstraction took 847776.16ms. Allocated memory was 167.8MB in the beginning and 893.4MB in the end (delta: 725.6MB). Free memory was 40.8MB in the beginning and 522.0MB in the end (delta: -481.1MB). Peak memory consumption was 248.3MB. Max. memory is 8.0GB. [2025-04-13 17:58:45,600 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.14ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.01ms. Allocated memory is still 167.8MB. Free memory was 117.5MB in the beginning and 102.6MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.23ms. Allocated memory is still 167.8MB. Free memory was 102.6MB in the beginning and 100.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 54.98ms. Allocated memory is still 167.8MB. Free memory was 100.7MB in the beginning and 98.5MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 561.68ms. Allocated memory is still 167.8MB. Free memory was 98.5MB in the beginning and 41.5MB in the end (delta: 57.0MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * TraceAbstraction took 847776.16ms. Allocated memory was 167.8MB in the beginning and 893.4MB in the end (delta: 725.6MB). Free memory was 40.8MB in the beginning and 522.0MB in the end (delta: -481.1MB). Peak memory consumption was 248.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (841states) and FLOYD_HOARE automaton (currently 11 states, 28 states before enhancement),while ReachableStatesComputation was computing reachable states (143 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (841states) and FLOYD_HOARE automaton (currently 11 states, 28 states before enhancement),while ReachableStatesComputation was computing reachable states (143 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (841states) and FLOYD_HOARE automaton (currently 11 states, 28 states before enhancement),while ReachableStatesComputation was computing reachable states (143 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 26 locations, 31 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 847.7s, OverallIterations: 149, TraceHistogramMax: 5, PathProgramHistogramMax: 130, EmptinessCheckTime: 0.1s, AutomataDifference: 477.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 24 mSolverCounterUnknown, 22048 SdHoareTripleChecker+Valid, 158.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22048 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 150.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3825 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 152371 IncrementalHoareTripleChecker+Invalid, 156220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3825 mSolverCounterUnsat, 0 mSDtfsCounter, 152371 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14729 GetRequests, 7129 SyntacticMatches, 10 SemanticMatches, 7590 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141357 ImplicationChecksByTransitivity, 161.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=841occurred in iteration=148, InterpolantAutomatonStates: 4914, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 95.7s AutomataMinimizationTime, 148 MinimizatonAttempts, 13071 StatesRemovedByMinimization, 144 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.9s SsaConstructionTime, 6.1s SatisfiabilityAnalysisTime, 204.8s InterpolantComputationTime, 8043 NumberOfCodeBlocks, 7154 NumberOfCodeBlocksAsserted, 667 NumberOfCheckSat, 11500 ConstructedInterpolants, 8 QuantifiedInterpolants, 143850 SizeOfPredicates, 3503 NumberOfNonLiveVariables, 32385 ConjunctsInSsa, 3779 ConjunctsInUnsatCore, 426 InterpolantComputations, 11 PerfectInterpolantSequences, 11530/16073 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